2988 search results - page 208 / 598 » Experiments with a New Boosting Algorithm |
138
Voted
GBRPR
2009
Springer
15 years 11 months ago
2009
Springer
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
139
Voted
PVM
2007
Springer
15 years 10 months ago
2007
Springer
We present a new, simple algorithmic idea for exploiting the potential for bidirectional communication present in many modern interconnects for the collective MPI operations broadc...
175
click to vote
PARA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
147
Voted
WEA
2009
Springer
15 years 9 months ago
2009
Springer
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
154
click to vote
SIGMOD
2000
ACM
15 years 9 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...