Sciweavers

1594 search results - page 275 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
14 years 2 months ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...
ICCV
2011
IEEE
13 years 11 months ago
Multi-hypothesis Motion Planning for Visual Object Tracking
In this paper, we propose a long-term motion model for visual object tracking. In crowded street scenes, persistent occlusions are a frequent challenge for tracking algorithm and ...
Haifeng Gong, Jack Sim, Maxim Likhachev, Jianbo Sh...
IPPS
2007
IEEE
15 years 6 months ago
Determining the Minimum Energy Consumption using Dynamic Voltage and Frequency Scaling
While improving raw performance is of primary interest to most users of high-performance computers, energy consumption also is a critical concern. Some microprocessors allow volta...
Min Yeol Lim, Vincent W. Freeh
MOBICOM
2012
ACM
13 years 2 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
15 years 6 months ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding