Sciweavers

2498 search results - page 410 / 500
» Data Structures with Unpredictable Timing
Sort
View
IMC
2010
ACM
14 years 9 months ago
Primitives for active internet topology mapping: toward high-frequency characterization
Current large-scale topology mapping systems require multiple days to characterize the Internet due to the large amount of probing traffic they incur. The accuracy of maps from ex...
Robert Beverly, Arthur Berger, Geoffrey G. Xie
SIAMSC
2010
132views more  SIAMSC 2010»
14 years 6 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi
ICIP
2007
IEEE
16 years 1 months ago
Isomap Tracking with Particle Filtering
The problem of tracking involves challenges like in-plane and out-of-plane rotations, scaling, variations in ambient light and occlusions. In this paper we look at the problem of ...
Nikhil Rane, Stanley T. Birchfield
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 13 days ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
186
Voted
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 4 days ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...