Sciweavers

5165 search results - page 925 / 1033
» Consistency of the Neighbor-Net Algorithm
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 8 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 8 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
14 years 8 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 8 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
EDBT
2008
ACM
167views Database» more  EDBT 2008»
14 years 8 months ago
HISSCLU: a hierarchical density-based method for semi-supervised clustering
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
Christian Böhm, Claudia Plant