Sciweavers

569 search results - page 31 / 114
» Dynamic Factor Graphs for Time Series Modeling
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
FOCS
2008
IEEE
14 years 3 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
13 years 10 months ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
CVPR
2004
IEEE
14 years 11 days ago
Modeling Complex Motion by Tracking and Editing Hidden Markov Graphs
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
Yizhou Wang, Song Chun Zhu
WSC
1989
13 years 9 months ago
Adaptive distribution of model components via congestion measures
One of the factors affecting the performance of distributed simulation models is the assignment of logical processes to processors. This paper outlines a dynamic allocation scheme...
Murali S. Shanker, W. David Kelton, Rema Padman