Sciweavers

6740 search results - page 206 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICALP
2003
Springer
14 years 4 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
AIPS
2006
14 years 5 days ago
On the Use of UML.P for Modeling a Real Application as a Planning Problem
There is a great interest in the planning community to apply all developments already achieved in the area to real applications. Such scenario makes the community focus on Knowled...
Tiago Stegun Vaquero, Flavio Tonidandel, Leliane N...
NIPS
2004
14 years 4 days ago
Supervised Graph Inference
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
Jean-Philippe Vert, Yoshihiro Yamanishi
ECCV
2006
Springer
15 years 19 days ago
A Simple Solution to the Six-Point Two-View Focal-Length Problem
Abstract. This paper presents a simple and practical solution to the 6-point 2view focal-length estimation problem. Based on the hidden-variable technique we have derived a 15th de...
Hongdong Li
WADS
2007
Springer
113views Algorithms» more  WADS 2007»
14 years 4 months ago
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans R...