Sciweavers

166 search results - page 32 / 34
» Spiders as Robust Point Descriptors
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
88
Voted
ATAL
2006
Springer
15 years 3 months ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer
ATAL
2006
Springer
15 years 3 months ago
Learning to cooperate in multi-agent social dilemmas
In many Multi-Agent Systems (MAS), agents (even if selfinterested) need to cooperate in order to maximize their own utilities. Most of the multi-agent learning algorithms focus on...
Jose Enrique Munoz de Cote, Alessandro Lazaric, Ma...
107
Voted
SIGGRAPH
1997
ACM
15 years 3 months ago
Object shape and reflectance modeling from observation
An object model for computer graphics applications should contain two aspects of information: shape and reflectance properties of the object. A number of techniques have been deve...
Yoichi Sato, Mark D. Wheeler, Katsushi Ikeuchi
105
Voted
CIKM
2008
Springer
15 years 1 months ago
Cross-lingual query classification: a preliminary study
The non-English Web is growing at breakneck speed, but available language processing tools are mostly English based. Taxonomies are a case in point: while there are plenty of comm...
Xuerui Wang, Andrei Z. Broder, Evgeniy Gabrilovich...