Sciweavers

817 search results - page 145 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
CPAIOR
2007
Springer
14 years 1 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
CP
2004
Springer
14 years 28 days ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
HICSS
2003
IEEE
156views Biometrics» more  HICSS 2003»
14 years 24 days ago
Developing Video Services for Mobile Users
Video information, image processing and computer vision techniques are developing rapidly nowadays because of the availability of acquisition, processing and editing tools, which ...
Mohamed Ahmed, Roger Impey, Ahmed Karmouch
CVPR
2009
IEEE
14 years 2 months ago
On compositional Image Alignment, with an application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
Brian Amberg, Andrew Blake, Thomas Vetter
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 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