Sciweavers

608 search results - page 60 / 122
» Random Systems with Complete Connections
Sort
View
SIGIR
2008
ACM
14 years 9 months ago
A simple and efficient sampling method for estimating AP and NDCG
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge te...
Emine Yilmaz, Evangelos Kanoulas, Javed A. Aslam
SGP
2004
15 years 5 days ago
A Remeshing Approach to Multiresolution Modeling
Providing a thorough mathematical foundation, multiresolution modeling is the standard approach for global surface deformations that preserve fine surface details in an intuitive ...
Mario Botsch, Leif Kobbelt
SIROCCO
2000
14 years 11 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
RAS
2006
86views more  RAS 2006»
14 years 9 months ago
Using cellular automata and gradients to control self-reconfiguration
Self-reconfigurable robots are built from modules, which are autonomously able to change the way they are connected. Such a robot can, through this self-reconfiguration process, c...
Kasper Støy
CDC
2008
IEEE
134views Control Systems» more  CDC 2008»
15 years 4 months ago
Dynamic vehicle routing with heterogeneous demands
— In this paper we study a variation of the Dynamic Traveling Repairperson Problem (DTRP) in which there are two classes of demands; high priority, and low priority. In the probl...
Stephen L. Smith, Marco Pavone, Francesco Bullo, E...