1982 search results - page 94 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
136
Voted
WWW
2003
ACM
16 years 3 months ago
2003
ACM
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
122
click to vote
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper develops an efficient new method for 3D partial shape retrieval. First, a Monte Carlo sampling strategy is employed to extract local shape signatures from each 3D model...
135
Voted
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...
148
Voted
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...
138
click to vote
JSAC
2006
15 years 2 months ago
2006
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...