Sciweavers

9588 search results - page 1681 / 1918
» Service Value Networks
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 4 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
SIGMOD
2002
ACM
132views Database» more  SIGMOD 2002»
16 years 4 months ago
Clustering by pattern similarity in large data sets
Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of th...
Haixun Wang, Wei Wang 0010, Jiong Yang, Philip S. ...
ICFP
2003
ACM
16 years 4 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
WSDM
2010
ACM
213views Data Mining» more  WSDM 2010»
16 years 1 months ago
Corroborating Information from Disagreeing Views
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
Alban Galland, Serge Abiteboul, Amélie Mari...
ICDE
2010
IEEE
399views Database» more  ICDE 2010»
15 years 11 months ago
Discovery-driven graph summarization
Abstract— Large graph datasets are ubiquitous in many domains, including social networking and biology. Graph summarization techniques are crucial in such domains as they can ass...
Ning Zhang, Yuanyuan Tian, Jignesh M. Patel
« Prev « First page 1681 / 1918 Last » Next »