Sciweavers

1053 search results - page 178 / 211
» Estimating Execution Time of Distributed Applications
Sort
View
128
Voted
FOCS
2007
IEEE
15 years 9 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
127
Voted
IMC
2007
ACM
15 years 4 months ago
On optimal probing for delay and loss measurement
Packet delay and loss are two fundamental measures of performance. Using active probing to measure delay and loss typically involves sending Poisson probes, on the basis of the PA...
François Baccelli, Sridhar Machiraju, Darry...
138
Voted
IEEEPACT
2009
IEEE
15 years 9 months ago
Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
Basilio B. Fraguela, Yevgen Voronenko, Markus P&uu...
116
Voted
IJCV
2006
100views more  IJCV 2006»
15 years 2 months ago
A General Framework for Combining Visual Trackers - The "Black Boxes" Approach
Abstract. Over the past few years researchers have been investigating the enhancement of visual tracking performance by devising trackers that simultaneously make use of several di...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
140
Voted
EDBT
2009
ACM
116views Database» more  EDBT 2009»
15 years 7 months ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...