680 search results - page 57 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
ECCC
2010
15 years 3 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
123
click to vote
CONEXT
2009
ACM
15 years 4 months ago
2009
ACM
ThunderDome is a system for collaboratively measuring upload bandwidths in ad-hoc peer-to-peer systems. It works by scheduling bandwidth probes between pairs of hosts, wherein eac...
217
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
210
Voted
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
121
click to vote
TKDE
2008
15 years 3 months ago
2008
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...