Sciweavers

2239 search results - page 288 / 448
» Computing with abstract matrix structures
Sort
View
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 10 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
120
Voted
TASLP
2010
167views more  TASLP 2010»
14 years 10 months ago
Broadband Source Localization From an Eigenanalysis Perspective
Abstract--Broadband source localization has several applications ranging from automatic video camera steering to target signal tracking and enhancement through beamforming. Consequ...
Mehrez Souden, Jacob Benesty, Sofiène Affes
FOCS
2009
IEEE
15 years 10 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
LATIN
2004
Springer
15 years 8 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
142
Voted
PPOPP
2012
ACM
13 years 11 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal