Sciweavers

15073 search results - page 291 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
169
Voted
CVPR
2011
IEEE
14 years 8 months ago
Connecting Non-Quadratic Variational Models and MRFs
Spatially-discrete Markov random fields (MRFs) and spatially-continuous variational approaches are ubiquitous in low-level vision, including image restoration, segmentation, opti...
Kevin Schelten, Stefan Roth
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
15 years 4 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
125
Voted
FATES
2006
Springer
15 years 8 months ago
Goldilocks: Efficiently Computing the Happens-Before Relation Using Locksets
We present a new lockset-based algorithm, Goldilocks, for precisely computing the happens-before relation and thereby detecting data-races at runtime. Dynamic race detection algori...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
163
Voted
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 10 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
EC
2006
195views ECommerce» more  EC 2006»
15 years 4 months ago
Automated Global Structure Extraction for Effective Local Building Block Processing in XCS
Learning Classifier Systems (LCSs), such as the accuracy-based XCS, evolve distributed problem solutions represented by a population of rules. During evolution, features are speci...
Martin V. Butz, Martin Pelikan, Xavier Llorà...