Sciweavers

3192 search results - page 591 / 639
» The minimum latency problem
Sort
View
JSAT
2006
134views more  JSAT 2006»
13 years 8 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
TSMC
2008
225views more  TSMC 2008»
13 years 8 months ago
Robust Methods for Geometric Primitive Recovery and Estimation From Range Images
We present a method for the recovery of partially occluded 3D geometric primitives from range images which might also include non-primitive objects. The method uses a technique for...
Irina Lavva, Eyal Hameiri, Ilan Shimshoni
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 6 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
TASLP
2011
13 years 3 months ago
Time-Frequency Cepstral Features and Heteroscedastic Linear Discriminant Analysis for Language Recognition
Abstract—The shifted delta cepstrum (SDC) is a widely used feature extraction for language recognition (LRE). With a high context width due to incorporation of multiple frames, S...
Weiqiang Zhang, Liang He, Yan Deng, Jia Liu, M. T....
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 3 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...