106 search results - page 15 / 22 » Characterizing Minimal Interval Completions |
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Today’s wirelessly networked embedded systems underlie a vast array of electronic devices, performing computation, communication, and input/output. A major design goal...
ISTCS
1997
Springer
13 years 11 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Text documents often embed data that is structured in nature. By processing a text database with information extraction systems, we can define a variety of structured "relati...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— We describe the design of a juggling robot that is able to vertically bounce a completely unconstrained ball without any sensing. The robot consists of a linear motor actuating...