Sciweavers

6740 search results - page 207 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
TJS
2002
122views more  TJS 2002»
13 years 10 months ago
Optimal BSR Solutions to Several Convex Polygon Problems
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
Jean Frédéric Myoupo, David Sem&eacu...
TCS
2008
13 years 10 months ago
An annotated bibliography on guaranteed graph searching
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In t...
Fedor V. Fomin, Dimitrios M. Thilikos
INFOCOM
2008
IEEE
14 years 5 months ago
Queueing Analysis of Loss Systems with Variable Optical Delay Lines
—Recently, a new optical device called variable optical delay line (VODL) has been proposed in the literature. As suggested by its name, the delay of a VODL can be dynamically se...
Duan-Shin Lee, Cheng-Shang Chang, Jay Cheng, Horng...
PG
2007
IEEE
14 years 5 months ago
Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
Shin Yoshizawa, Alexander G. Belyaev, Hideo Yokota...
ECCV
2006
Springer
15 years 19 days ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté