Sciweavers

6437 search results - page 578 / 1288
» Parallel Algorithms for Arrangements
Sort
View
3DOR
2010
15 years 2 months ago
Learning the Compositional Structure of Man-Made Objects for 3D Shape Retrieval
While approaches based on local features play a more and more important role for 3D shape retrieval, the problems of feature selection and similarity measurement between sets of l...
Raoul Wessel, Reinhard Klein
ICSE
2010
IEEE-ACM
15 years 9 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
SPAA
1997
ACM
15 years 11 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
ICDE
2007
IEEE
141views Database» more  ICDE 2007»
16 years 8 months ago
Monitoring Regular Expressions on Out-of-Order Streams
We present an efficient algorithm for regular expression matching on streams with out of order data, while maintaining a small state and without complete stream reconstruction. We...
Theodore Johnson, S. Muthukrishnan, Irina Rozenbau...
ACL
2000
15 years 8 months ago
Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
Marcel P. van Lohuizen