6365 search results - page 1026 / 1273 » Fast Local Computation Algorithms |
181
click to vote
MVA
2000
15 years 8 months ago
2000
Touch screens are very convenient because one can directly point to where it is interesting. This paper presents an inexpensive technique to transform an ordinary screen into a to...
158
click to vote
IPPS
2006
IEEE
16 years 22 days ago
2006
IEEE
The need to allow threads to abort an attempt to acquire a lock (sometimes called a timeout) is an interesting new requirement driven by state-of-the-art database applications wit...
176
click to vote
IPPS
2006
IEEE
16 years 22 days ago
2006
IEEE
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
178
click to vote
MOBIHOC
2006
ACM
16 years 19 days ago
2006
ACM
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...
198
click to vote
SAC
2004
ACM
16 years 3 days ago
2004
ACM
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...