Sciweavers

2208 search results - page 333 / 442
» Memory Practices in the Sciences
Sort
View
SPAA
1997
ACM
14 years 2 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
190views Database» more  ICDE 2007»
14 years 2 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
IE
2007
13 years 11 months ago
Through the looking glass: game worlds as representations and views from elsewhere
This paper describes the rationale and subsequent development stages of a work in progress: a graffiti toolkit for rich spatial 3D environments and an actual world mnemonic collec...
J. Turner, Nicola J. Bidwell
ENTCS
2007
134views more  ENTCS 2007»
13 years 10 months ago
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 10 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...