Sciweavers

2924 search results - page 364 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPPS
2006
IEEE
15 years 10 months ago
Reconfigurable communications for image processing applications
: This work tries to reuse programmable communication resources like a Network-on-Chip (NoC) in the acceleration of image applications. We show a mathematical model for the computa...
André Borin Soares, Luigi Carro, Altamiro A...
HPDC
2005
IEEE
15 years 10 months ago
Increasing application performance in virtual environments through run-time inference and adaptation
Virtual machine distributed computing greatly simplifies the use of widespread computing resources by lowering the abstraction, benefiting both resource providers and users. Tow...
Ananth I. Sundararaj, Ashish Gupta, Peter A. Dinda
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 4 months ago
Statistical analysis of sketch estimators
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
Florin Rusu, Alin Dobra
ICCV
2009
IEEE
16 years 9 months ago
Joint optimization of segmentation and appearance models
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother
ICCV
2005
IEEE
16 years 6 months ago
Globally Optimal Estimates for Geometric Reconstruction Problems
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
Fredrik Kahl, Didier Henrion