2127 search results - page 74 / 426 » Computing large matchings fast |
149
Voted
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
154
Voted
WWW
2003
ACM
16 years 4 months ago
2003
ACM
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
144
Voted
KDD
2000
ACM
15 years 7 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
108
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we describe a sequential simulation method to simulate large parallel homo- and heterogeneous systems on a single FPGA. The method is applicable for parallel systems...
136
click to vote
SP
2008
IEEE
15 years 10 months ago
2008
IEEE
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...