Sciweavers

5350 search results - page 1012 / 1070
» Space and time in eco-ontologies
Sort
View
STOC
2010
ACM
199views Algorithms» more  STOC 2010»
15 years 2 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
Vladimir Braverman and Rafail Ostrovsky
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 2 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
SPAA
2010
ACM
15 years 2 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
COCOON
2010
Springer
15 years 2 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
« Prev « First page 1012 / 1070 Last » Next »