2168 search results - page 27 / 434 » Randomized Algorithms and Complexity Theory |
119
Voted
ICISP
2010
Springer
15 years 4 months ago
2010
Springer
High-resolution nuclear magnetic resonance (NMR) spectra contain important biomarkers that have potentials for early diagnosis of disease and subsequent monitoring of its progressi...
112
click to vote
ICIP
2003
IEEE
16 years 1 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
EOR
2008
14 years 11 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
PODC
2009
ACM
15 years 4 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
134
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...