Sciweavers

16883 search results - page 306 / 3377
» Generalized Non-Reducible Descriptors
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
SIGMOD
2008
ACM
118views Database» more  SIGMOD 2008»
16 years 6 months ago
Freebase: a collaboratively created graph database for structuring human knowledge
Freebase is a practical, scalable tuple database used to structure general human knowledge. The data in Freebase is collaboratively created, structured, and maintained. Freebase c...
Kurt D. Bollacker, Colin Evans, Praveen Paritosh, ...
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
16 years 6 months ago
Leveraging aggregate constraints for deduplication
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
Surajit Chaudhuri, Anish Das Sarma, Venkatesh Gant...
SIGMOD
2007
ACM
137views Database» more  SIGMOD 2007»
16 years 6 months ago
Intensional associations between data and metadata
There is a growing need to associate a variety of metadata with the underlying data, but a simple, elegant approach to uniformly model and query both the data and the metadata has...
Divesh Srivastava, Yannis Velegrakis
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 6 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar