Sciweavers

16430 search results - page 642 / 3286
» On Computable Tree Functions
Sort
View
COMGEO
2004
ACM
15 years 7 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...
DSN
2009
IEEE
15 years 5 months ago
RRE: A game-theoretic intrusion Response and Recovery Engine
Preserving the availability and integrity of networked computing systems in the face of fast-spreading intrusions requires advances not only in detection algorithms, but also in a...
Saman A. Zonouz, Himanshu Khurana, William H. Sand...
RECOMB
2009
Springer
16 years 7 months ago
Storage and Retrieval of Individual Genomes
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
Gonzalo Navarro, Jouni Sirén, Niko Väl...
RECOMB
2006
Springer
16 years 7 months ago
Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer
Prokaryotic organisms share genetic material across species boundaries by means of a process known as horizontal gene transfer (HGT). Detecting this process bears great significanc...
Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nak...
CLUSTER
2005
IEEE
16 years 25 days ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman