Sciweavers

1101 search results - page 16 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
SPIRE
2010
Springer
14 years 8 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
GRID
2010
Springer
14 years 7 months ago
Parallel SAT Solving on Peer-to-Peer Desktop Grids
Abstract Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domainspecific problems inherent to one of the most challenging environments f...
Sven Schulz, Wolfgang Blochinger
74
Voted
ECCV
2008
Springer
15 years 11 months ago
Beyond Nouns: Exploiting Prepositions and Comparative Adjectives for Learning Visual Classifiers
Learning visual classifiers for object recognition from weakly labeled data requires determining correspondence between image regions and semantic object classes. Most approaches u...
Abhinav Gupta, Larry S. Davis
PG
2000
IEEE
15 years 2 months ago
A New Adaptive Density Estimator for Particle-Tracing Radiosity
Inparticle-tracing radiosityalgorithms, energy-carrying particles are traced through an environmentfor simulating global illumination. Illumination on a surface is reconstructed f...
Wong Kam Wah
RECOMB
2002
Springer
15 years 10 months ago
A new approach to analyzing gene expression time series data
We present algorithms for time-series gene expression analysis that permit the principled estimation of unobserved timepoints, clustering, and dataset alignment. Each expression p...
Ziv Bar-Joseph, Georg Gerber, David K. Gifford, To...