49 search results - page 9 / 10 » Augmenting Suffix Trees, with Applications |
VLDB
2000
ACM
13 years 9 months ago
2000
ACM
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
BIRTHDAY
2008
Springer
13 years 7 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
ICCAD
1997
IEEE
13 years 10 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
ICNP
1998
IEEE
13 years 10 months ago
1998
IEEE
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
FSTTCS
2009
Springer
14 years 10 days ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...