Sciweavers

1536 search results - page 132 / 308
» Approximately Dominating Representatives
Sort
View
AIPS
2008
15 years 6 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
15 years 5 months ago
Using differential evolution for symbolic regression and numerical constant creation
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
Brian M. Cerny, Peter C. Nelson, Chi Zhou
CORR
2010
Springer
190views Education» more  CORR 2010»
15 years 4 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
CVPR
2007
IEEE
16 years 6 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
ECCV
2008
Springer
16 years 5 months ago
Prior-Based Piecewise-Smooth Segmentation by Template Competitive Deformation Using Partitions of Unity
We propose a new algorithm for two-phase, piecewise-smooth segmentation with shape prior. The image is segmented by a binary template that is deformed by a regular geometric transf...
Benoit Mory, Laurent D. Cohen, Oudom Somphone, Sh&...