Sciweavers

849 search results - page 27 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
IROS
2009
IEEE
176views Robotics» more  IROS 2009»
14 years 2 months ago
A new modular schema for the control of tumbling robots
— Tumbling is an exciting new area of robotic locomotion that takes advantage of ground-body interactions to achieve rich motions with minimal hardware complexity. The increased ...
Brett Hemes, Nikolaos Papanikolopoulos
TON
2008
99views more  TON 2008»
13 years 7 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
PAMI
2010
222views more  PAMI 2010»
13 years 6 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
JACM
2008
91views more  JACM 2008»
13 years 7 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari