Sciweavers

1243 search results - page 81 / 249
» On the locality of bounded growth
Sort
View
AI
2008
Springer
13 years 10 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
13 years 10 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 10 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
JSAT
2010
132views more  JSAT 2010»
13 years 4 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres
CVPR
2012
IEEE
12 years 15 days ago
Discovering localized attributes for fine-grained recognition
Attributes are visual concepts that can be detected by machines, understood by humans, and shared across categories. They are particularly useful for fine-grained domains where c...
Kun Duan, Devi Parikh, David J. Crandall, Kristen ...