380 search results - page 12 / 76 » A Categorical Setting for Lower Complexity |
187
click to vote
STOC
2012
ACM
13 years 1 days ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
IUI
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we present CoTester, a system designed to decrease the difficulty of testing web applications. CoTester allows testers to create test scripts that are represented ...
166
click to vote
ICDE
1999
IEEE
15 years 11 months ago
1999
IEEE
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...