Sciweavers

17366 search results - page 3140 / 3474
» New Revision Algorithms
Sort
View
CPAIOR
2006
Springer
15 years 10 months ago
Duality in Optimization and Constraint Satisfaction
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
John N. Hooker
CIVR
2010
Springer
204views Image Analysis» more  CIVR 2010»
15 years 10 months ago
Utilizing related samples to learn complex queries in interactive concept-based video search
One of the main challenges in interactive concept-based video search is the insufficient relevant sample problem, especially for queries with complex semantics. To address this pr...
Jin Yuan, Zheng-Jun Zha, Zhengdong Zhao, Xiangdong...
GECCO
2006
Springer
215views Optimization» more  GECCO 2006»
15 years 10 months ago
A multi-chromosome approach to standard and embedded cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...
James Alfred Walker, Julian Francis Miller, Rachel...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 10 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
WWW
2010
ACM
15 years 10 months ago
Enabling entity-based aggregators for web 2.0 data
Selecting and presenting content culled from multiple heterogeneous and physically distributed sources is a challenging task. The exponential growth of the web data in modern time...
Ekaterini Ioannou, Claudia Niederée, Yannis...
« Prev « First page 3140 / 3474 Last » Next »