Sciweavers

5595 search results - page 968 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
162
Voted
CCGRID
2003
IEEE
15 years 11 months ago
Scheduling Distributed Applications: the SimGrid Simulation Framework
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...
Arnaud Legrand, Loris Marchal, Henri Casanova
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
Articulated Billboards for Video-based Rendering
We present a novel representation and rendering method for free-viewpoint video of human characters based on multiple input video streams. The basic idea is to approximate the art...
Marcel Germann, Alexander Hornung, Richard Keiser,...
CN
2000
107views more  CN 2000»
15 years 5 months ago
Query routing for Web search engines: architecture and experiments
General-purpose search engines such as AltaVista and Lycos are notorious for returning irrelevant results in response to user queries. Consequently, thousands of specialized, topi...
Atsushi Sugiura, Oren Etzioni
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
16 years 6 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
DAGM
2009
Springer
15 years 10 months ago
An Efficient Linear Method for the Estimation of Ego-Motion from Optical Flow
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
Florian Raudies, Heiko Neumann