Sciweavers

995 search results - page 111 / 199
» complexity 2011
Sort
View
150
Voted
PODC
2011
ACM
14 years 6 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
152
Voted
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 3 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
162
Voted
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 10 months ago
Analysis of multi-stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...
188
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
134
Voted
CVPR
2011
IEEE
14 years 7 months ago
Visual textures as realizations of multivariate log-Gaussian Cox processes
In this paper, we address invariant keypoint-based texture characterization and recognition. Viewing keypoint sets associated with visual textures as realizations of point process...
Huu-Giao Nguyen, Ronan Fablet, Jean-Marc Boucher