Sciweavers

468 search results - page 83 / 94
» Optimization of in-network data reduction
Sort
View
CVGIP
2006
75views more  CVGIP 2006»
13 years 9 months ago
Momentum-based parameterization of dynamic character motion
This paper presents a system for rapid editing of highly dynamic motion capture data. At the heart of this system is an optimization algorithm that can transform the captured moti...
Yeuhi Abe, C. Karen Liu, Zoran Popovic
CNSM
2010
13 years 7 months ago
DP+IP = design of efficient backup scheduling
Many industries experience an explosion in digital content. This explosion of electronic documents, along with new regulations and document retention rules, sets new requirements f...
Ludmila Cherkasova, Alex Zhang, Xiaozhou Li
CF
2006
ACM
14 years 1 months ago
An efficient cache design for scalable glueless shared-memory multiprocessors
Traditionally, cache coherence in large-scale shared-memory multiprocessors has been ensured by means of a distributed directory structure stored in main memory. In this way, the ...
Alberto Ros, Manuel E. Acacio, José M. Garc...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 10 months ago
Practical guide to controlled experiments on the web: listen to your customers not to the hippo
The web provides an unprecedented opportunity to evaluate ideas quickly using controlled experiments, also called randomized experiments (single-factor or factorial designs), A/B ...
Ron Kohavi, Randal M. Henne, Dan Sommerfield
FOCS
2009
IEEE
14 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu