Sciweavers

53 search results - page 4 / 11
» The Dynamic Locking Heuristic - A New Graph Partitioning Alg...
Sort
View
ICIP
2005
IEEE
14 years 8 months ago
Visual tracking using sequential importance sampling with a state partition technique
Sequential importance sampling (SIS), also known as particle filtering, has drawn increasing attention recently due to its superior performance in nonlinear and non-Gaussian dynam...
Yan Zhai, Mark B. Yeary, Joseph P. Havlicek, Jean-...
ICS
2009
Tsinghua U.
13 years 11 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
INFOCOM
2008
IEEE
14 years 1 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
CVPR
2006
IEEE
14 years 9 months ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
David Tolliver, Gary L. Miller
IPPS
2009
IEEE
14 years 1 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader