1021 search results - page 100 / 205 » Fast Approximate PCPs |
146
click to vote
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
139
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
114
click to vote
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
131
click to vote
ICCD
2007
IEEE
15 years 12 months ago
2007
IEEE
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
147
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...