Sciweavers

1053 search results - page 192 / 211
» On k-Path Covers and their applications
Sort
View
WWW
2002
ACM
14 years 10 months ago
Clustering for opportunistic communication
We describe ongoing work on I2I, a system aimed at fostering opportunistic communication among users viewing or manipulating content on the Web and in productivity applications. U...
Jay Budzik, Shannon Bradshaw, Xiaobin Fu, Kristian...
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 10 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 10 months ago
A gauss function based approach for unbalanced ontology matching
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...
Qian Zhong, Hanyu Li, Juanzi Li, Guo Tong Xie, Jie...
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
14 years 10 months ago
Report on the First International VLDB Workshop on Clean Databases (CleanDB 2006)
In this report, we provide a summary1 of the First Int'l VLDB Workshop on Clean Databases (CleanDB 2006), which took place at Seoul, Korea, on September 11, 2006, in conjunct...
Dongwon Lee, Chen Li