Sciweavers

2412 search results - page 153 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
IPPS
2000
IEEE
15 years 7 months ago
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
Achour Mostéfaoui, Michel Raynal
129
Voted
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 3 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
122
Voted
ICIP
2005
IEEE
16 years 5 months ago
Correlation estimation for distributed source coding under information exchange constraints
Distributed source coding (DSC) depends strongly on accurate knowledge of correlation between sources. Previous works have reported capacity-approaching code constructions when ex...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega
142
Voted
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 3 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
124
Voted
APNOMS
2006
Springer
15 years 7 months ago
An Enhanced RED-Based Scheme for Differentiated Loss Guarantees
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
Jahwan Koo, Vladimir V. Shakhov, Hyunseung Choo