2069 search results - page 191 / 414 » Linear time algorithms for Clobber |
195
click to vote
IWCIA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
163
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
230
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
215
click to vote
AFRIGRAPH
2004
ACM
16 years 1 hour ago
2004
ACM
We describe techniques for exploring 3D scenes by combining non-linear projections with the interactive data mining of camera navigations from previous explorations. Our approach ...
182
click to vote
GLOBECOM
2006
IEEE
16 years 18 days ago
2006
IEEE
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...