2127 search results - page 349 / 426 » Computing large matchings fast |
123
click to vote
USENIX
2003
15 years 5 months ago
2003
This paper presents a new asynchronous programming library (libasync-smp) that allows event-driven applications to take advantage of multiprocessors by running code for event hand...
CAGD
2007
15 years 3 months ago
2007
We present a family of discrete isometric bending models (IBMs) for triangulated surfaces in 3-space. These models are derived from an axiomatic treatment of discrete Laplace oper...
289
click to vote
EOR
2007
15 years 3 months ago
2007
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
136
click to vote
PC
1998
15 years 3 months ago
1998
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...
162
Voted
PAMI
2007
15 years 3 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....