Sciweavers

189 search results - page 24 / 38
» Making a case for a Green500 list
Sort
View
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
16 years 6 days ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
93
Voted
CADE
2001
Springer
16 years 3 days ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 2 days ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
16 years 18 hour ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...
PODS
2005
ACM
151views Database» more  PODS 2005»
15 years 12 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...