Sciweavers

1146 search results - page 174 / 230
» Finite cupping sets
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 9 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
CORR
2008
Springer
161views Education» more  CORR 2008»
13 years 8 months ago
Compressed Sensing of Analog Signals
Abstract--A traditional assumption underlying most data converters is that the signal should be sampled at a rate exceeding twice the highest frequency. This statement is based on ...
Yonina C. Eldar
FOCS
2010
IEEE
13 years 8 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet
WWW
2003
ACM
14 years 10 months ago
Conversation specification: a new approach to design and analysis of e-service composition
This paper introduces a framework for modeling and specifying the global behavior of e-service compositions. Under this framework, peers (individual e-services) communicate throug...
Tevfik Bultan, Xiang Fu, Richard Hull, Jianwen Su
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 10 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...