Sciweavers

551 search results - page 52 / 111
» Continuous Search in Constraint Programming
Sort
View
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 9 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
SIAMCOMP
2000
88views more  SIAMCOMP 2000»
13 years 8 months ago
Gadgets, Approximation, and Linear Programming
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, Dav...
CP
2003
Springer
14 years 2 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
ICIP
2001
IEEE
14 years 10 months ago
Optimal radial contour tracking by dynamic programming
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...
Yunqiang Chen, Thomas S. Huang, Yong Rui
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
13 years 9 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler