Sciweavers

1941 search results - page 372 / 389
» On the Hardness of Approximate Reasoning
Sort
View
144
Voted
KDD
2012
ACM
190views Data Mining» more  KDD 2012»
13 years 2 months ago
Multi-label hypothesis reuse
Multi-label learning arises in many real-world tasks where an object is naturally associated with multiple concepts. It is well-accepted that, in order to achieve a good performan...
Sheng-Jun Huang, Yang Yu, Zhi-Hua Zhou
PODC
2012
ACM
13 years 2 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
16 years 2 days ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
GIS
2004
ACM
16 years 24 days ago
A serverless 3D world
Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interacti...
Egemen Tanin, Aaron Harwood, Hanan Samet, Sarana N...
GIS
2005
ACM
16 years 24 days ago
ASPEN: an adaptive spatial peer-to-peer network
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku