10414 search results - page 303 / 2083 » An efficient algorithm for Co-segmentation |
156
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
120
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment....
170
click to vote
3DIM
2001
IEEE
15 years 10 months ago
2001
IEEE
A novel solution is presented to the Nearest Neighbor Problem that is specifically tailored for determining correspondences within the Iterative Closest Point Algorithm. The refer...
173
click to vote
AFRIGRAPH
2003
ACM
15 years 10 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
146
click to vote
CDES
2006
15 years 8 months ago
2006
Many algorithms have been devised and studied for dynamic contiguous memory allocation. In the absence of enough contiguous memory to satisfy a particular request, one approach is...