2107 search results - page 280 / 422 » Computing Small Search Numbers in Linear Time |
STACS
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
JSAC
2008
13 years 9 months ago
2008
In this paper, we consider the problem of estimating the state of a dynamical system from distributed noisy measurements. Each agent constructs a local estimate based on its own m...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
BMCBI
2010
13 years 9 months ago
2010
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...