Sciweavers

2309 search results - page 155 / 462
» Efficient Topological Exploration
Sort
View
TVCG
2011
100views more  TVCG 2011»
13 years 3 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber
VIS
2007
IEEE
117views Visualization» more  VIS 2007»
14 years 9 months ago
IStar: A Raster Representation for Scalable Image and Volume Data
Topology has been an important tool for analyzing scalar data and flow fields in visualization. In this work, we analyze the topology of multivariate image and volume data sets wit...
Joe Kniss, Warren Hunt, Kristin Potter, Pradeep...
ICLP
2009
Springer
14 years 8 months ago
A Language for Large Ensembles of Independently Executing Nodes
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
Michael P. Ashley-Rollman, Peter Lee, Seth Copen G...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 8 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
SECURWARE
2008
IEEE
14 years 2 months ago
A Body-Centered Cubic Method for Key Agreement in Dynamic Mobile Ad Hoc Networks
Mobile ad hoc networking is an operating mode for rapid mobile host interconnection, where nodes rely on each other, in order to maintain network connectivity and functionality. S...
Ioannis G. Askoxylakis, Damien Sauveron, Constanti...