Sciweavers

3019 search results - page 440 / 604
» Approximating the Domatic Number
Sort
View
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 7 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
CHI
2008
ACM
16 years 7 months ago
Query suggestions for mobile search: understanding usage patterns
Entering search terms on mobile phones is a time consuming and cumbersome task. In this paper, we explore the usage patterns of query entry interfaces that display suggestions. Ou...
Maryam Kamvar, Shumeet Baluja
HPCA
2006
IEEE
16 years 6 months ago
Probabilistic counter updates for predictor hysteresis and stratification
Hardware counters are a fundamental building block of modern high-performance processors. This paper explores two applications of probabilistic counter updates, in which the outpu...
Nicholas Riley, Craig B. Zilles
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 6 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 6 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson