12519 search results - page 2415 / 2504 » Approximation Problems Categories |
128
click to vote
APGV
2004
ACM
15 years 8 months ago
2004
ACM
In this paper, we consider the problem of determining feature saliency for 3D objects and describe a series of experiments that examined if salient features exist and can be predi...
122
click to vote
ANCS
2006
ACM
15 years 8 months ago
2006
ACM
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
134
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
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...
154
Voted
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
110
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
We report on our ongoing practical experience in designing, implementing, and deploying PTIME, a personalized agent for time management and meeting scheduling in an open, multi-ag...