Sciweavers

11219 search results - page 189 / 2244
» Retroactive data structures
Sort
View
184
Voted
JCDCG
2000
Springer
15 years 10 months ago
Volume Queries in Polyhedra
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
John Iacono, Stefan Langerman
IJFCS
2008
110views more  IJFCS 2008»
15 years 6 months ago
Indexing Gapped-Factors Using a Tree
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
Pierre Peterlongo, Julien Allali, Marie-France Sag...
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
15 years 4 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
PODC
2011
ACM
14 years 9 months ago
On the power of hardware transactional memory to simplify memory management
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev,...
RIAO
2000
15 years 7 months ago
Multimedia structuring using trees
Traditionally work on multimedia structuring has been centered on the creation of indices and their use for searching. Although searching is important there are many cases where t...
George Tzanetakis, Luc Julia