Sciweavers

256 search results - page 17 / 52
» A Unified Approach to Approximating Partial Covering Problem...
Sort
View
FOCM
2008
100views more  FOCM 2008»
13 years 7 months ago
A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds
We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for the existence and local...
Felipe Alvarez, Jérôme Bolte, Julien ...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 10 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
NIPS
2000
13 years 9 months ago
Speech Denoising and Dereverberation Using Probabilistic Models
This paper presents a unified probabilistic framework for denoising and dereverberation of speech signals. The framework transforms the denoising and dereverberation problems into...
Hagai Attias, John C. Platt, Alex Acero, Li Deng
SOCO
2010
Springer
13 years 2 months ago
Using evolution strategies to solve DEC-POMDP problems
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
Baris Eker, H. Levent Akin
UML
1998
Springer
13 years 11 months ago
Automating the Synthesis of UML StateChart Diagrams from Multiple Collaboration Diagrams
The use of scenarios has become a popular technique for requirements elicitation and specification building. Since scenarios capture only partial descriptions of system behavior, ...
Ismaïl Khriss, Mohammed Elkoutbi, Rudolf K. K...