Sciweavers

1090 search results - page 81 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
VISUALIZATION
1997
IEEE
14 years 2 months ago
ROAMing terrain: real-time optimally adapting meshes
Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraf...
Mark A. Duchaineau, Murray Wolinsky, David E. Sige...
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 3 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
SGP
2007
14 years 18 days ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
BMCBI
2008
115views more  BMCBI 2008»
13 years 10 months ago
BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
George Chin Jr., Daniel G. Chavarría-Mirand...
INFOCOM
2009
IEEE
14 years 4 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...