2899 search results - page 552 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
106
click to vote
SIROCCO
2010
15 years 2 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
119
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
125
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
108
click to vote
VIS
2004
IEEE
16 years 2 months ago
2004
IEEE
We address the texture level-of-detail problem for extremely large surfaces such as terrain during realtime, view-dependent rendering. A novel texture hierarchy is introduced base...
181
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...