Sciweavers

995 search results - page 128 / 199
» complexity 2011
Sort
View
147
Voted
CORR
2011
Springer
245views Education» more  CORR 2011»
14 years 10 months ago
A linear framework for region-based image segmentation and inpainting involving curvature penalization
Abstract We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start f...
Thomas Schoenemann, Fredrik Kahl, Simon Masnou, Da...
131
Voted
CORR
2011
Springer
147views Education» more  CORR 2011»
14 years 10 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
136
Voted
CORR
2011
Springer
178views Education» more  CORR 2011»
14 years 10 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi
149
Voted
CORR
2011
Springer
206views Education» more  CORR 2011»
14 years 10 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
150
Voted
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 10 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...