2738 search results - page 46 / 548 » The Frobenius Problem and Its Generalizations |
CVPR
2008
IEEE
14 years 1 months ago
2008
IEEE
While there is a large class
of Multiple-Target Tracking (MTT) problems for which batch
processing is possible and desirable, batch MTT remains relatively
unexplored in comparis...
CP
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
BIRTHDAY
1994
Springer
13 years 11 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Latency-insensitive systems were recently proposed by Carloni et al. as a correct-by-construction methodology for single-clock system-on-a-chip (SoC) design using predesigned IP b...