2711 search results - page 444 / 543 » Mapping sequences by parts |
174
click to vote
MOBICOM
2006
ACM
16 years 10 days ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
191
click to vote
SCESM
2006
ACM
16 years 10 days ago
2006
ACM
Requirements models for large systems typically cannot be developed in a single step, but evolve in a sequence of iterations. We have developed such an iterative modeling process ...
169
click to vote
CCGRID
2003
IEEE
15 years 11 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
181
click to vote
FGR
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a method to recover the full-motion (3 rotations and 3 translations) of the head from an input video using a cylindrical head model. Given an initial reference...
204
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...