Sciweavers

234 search results - page 41 / 47
» A Distributed Algorithm for Ear Decomposition
Sort
View
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
MMSEC
2004
ACM
205views Multimedia» more  MMSEC 2004»
14 years 29 days ago
Wavelet-based blind watermarking of 3D models
Watermarking of 3D meshes has received a limited attention due to the difficulties encountered in extending the algorithms developed for 1D (audio) and 2D (images and video) signa...
F. Uccheddu, Massimiliano Corsini, Mauro Barni
SPAA
2003
ACM
14 years 24 days ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
ATAL
2003
Springer
14 years 24 days ago
Role allocation and reallocation in multiagent teams: towards a practical analysis
Despite the success of the BDI approach to agent teamwork, initial role allocation (i.e. deciding which agents to allocate to key roles in the team) and role reallocation upon fai...
Ranjit Nair, Milind Tambe, Stacy Marsella
CIKM
2008
Springer
13 years 9 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand