Sciweavers

4112 search results - page 361 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
242
Voted
ACCV
2010
Springer
15 years 2 months ago
Saliency Density Maximization for Object Detection and Localization
Accurate localization of the salient object from an image is a difficult problem when the saliency map is noisy and incomplete. A fast approach to detect salient objects from image...
Ye Luo, Junsong Yuan, Ping Xue, Qi Tian
CP
2009
Springer
16 years 8 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 7 months ago
A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
Danny Bickson, Elad Yom-Tov, Danny Dolev
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
16 years 9 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 9 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir