7303 search results - page 155 / 1461 » Optimality for dynamic patterns |
ISVC
2007
Springer
15 years 8 months ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
118
Voted
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
101
click to vote
ICCS
2005
Springer
15 years 7 months ago
2005
Springer
The cross fertilization of methods and techniques between different subject areas in the undergraduate curriculum is a challenge, especially at the more advanced levels. This paper...
124
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—In wireless sensor networks, asynchronous sleepwake scheduling protocols can significantly reduce energy consumption without incurring the communication overhead for cl...
131
click to vote
EMMCVPR
2005
Springer
15 years 7 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...