Sciweavers

677 search results - page 48 / 136
» Reducing the Space Requirement of LZ-Index
Sort
View
IJCAI
2007
14 years 11 months ago
Mechanism Design with Partial Revelation
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
Nathanael Hyafil, Craig Boutilier
ICMLA
2003
14 years 11 months ago
A Distributed Reinforcement Learning Approach to Pattern Inference in Go
— This paper shows that the distributed representation found in Learning Vector Quantization (LVQ) enables reinforcement learning methods to cope with a large decision search spa...
Myriam Abramson, Harry Wechsler
CGF
2005
159views more  CGF 2005»
14 years 9 months ago
Real-Time Shape Editing using Radial Basis Functions
Current surface-based methods for interactive freeform editing of high resolution 3D models are very powerful, but at the same time require a certain minimum tessellation or sampl...
Mario Botsch, Leif Kobbelt
PVLDB
2010
86views more  PVLDB 2010»
14 years 8 months ago
Swarm: Mining Relaxed Temporal Moving Object Clusters
Recent improvements in positioning technology make massive moving object data widely available. One important analysis is to find the moving objects that travel together. Existin...
Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays
CORR
2009
Springer
114views Education» more  CORR 2009»
14 years 7 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol