206 search results - page 9 / 42 » Three Hoppy path problems and ternary paths |
118
Voted
JUCS
2010
15 years 2 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
133
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we address the inverse problem of reconstructing a scene as well as the camera motion from the image sequence taken by an omni-directional camera. Our structure fro...
ISCAS
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper presents three techniques to reduce the power consumption in ternary content-addressable memories (TCAMs). The first technique is to use newly developed monolithical...
148
Voted
SIGMETRICS
2005
ACM
15 years 9 months ago
2005
ACM
Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures ...
118
click to vote
WG
2009
Springer
15 years 10 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...