Sciweavers

144 search results - page 13 / 29
» Sampling Techniques for Large, Dynamic Graphs
Sort
View
156
Voted
WOSP
1998
ACM
15 years 4 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...
100
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
Robust Geo-Routing on Embeddings of Dynamic Wireless Networks
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
97
Voted
APVIS
2004
15 years 1 months ago
Adding Filtering to Geometric Distortion to Visualize a Clustered Graph on Small Screens.
Presenting large amounts of information in a limited screen space is a significant challenge in the field of Information Visualization. With the rapid development and growing use ...
Wanchun Li, Masahiro Takatsuka
IWPC
2002
IEEE
15 years 5 months ago
Dependence-Cache Slicing: A Program Slicing Method Using Lightweight Dynamic Information
When we try to debug or to comprehend a large program, it is important to separate suspicious program portions from the overall source program. Program slicing is a promising tech...
Tomonori Takada, Fumiaki Ohata, Katsuro Inoue
AVSS
2006
IEEE
15 years 6 months ago
Nonparametric Background Modeling Using the CONDENSATION Algorithm
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
Xingzhi Luo, Suchendra M. Bhandarkar, Wei Hua, Hai...