Sciweavers

1884 search results - page 203 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
180
Voted
DAM
2008
109views more  DAM 2008»
15 years 6 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
SIAMJO
2008
76views more  SIAMJO 2008»
15 years 6 months ago
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
S. Damla Ahipasaoglu, E. Alper Yildirim
IJFCS
2007
93views more  IJFCS 2007»
15 years 6 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
CVGIP
2008
104views more  CVGIP 2008»
15 years 5 months ago
Topological simplification of isosurfaces in volumetric data using octrees
Volumetric data, such as output from CT scans or laser range scan processing methods, often have isosurfaces that contain topological noise--small handles and holes that are not p...
James Vanderhyde, Andrzej Szymczak
SIMPAR
2010
147views Robotics» more  SIMPAR 2010»
15 years 4 months ago
Exploration Strategies for a Robot with a Continously Rotating 3D Scanner
To benchmark the efficiency of exploration strategies one has to use robot simulators. In an exploration task, the robot faces an unknown environment. Of course one could test the ...
Elena Digor, Andreas Birk, Andreas Nüchter