Sciweavers

354 search results - page 45 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
CIKM
2005
Springer
14 years 29 days ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
IPMI
1999
Springer
14 years 8 months ago
Continuous Time Dynamic PET Imaging Using List Mode Data
Abstract. We describe a method for computing a continuous time estimate of dynamic changes in tracer density using list mode PET data. The tracer density in each voxel is modeled a...
Thomas E. Nichols, Jinyi Qi, Richard M. Leahy
CGF
2004
113views more  CGF 2004»
13 years 7 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...
IJCSA
2008
237views more  IJCSA 2008»
13 years 7 months ago
Development of A SOLAP Patrimony Management Application System: Fez Medina as a Case Study
It is well known that transactional and analytical systems each require different database architecture. In general, the database structure of transactional systems is optimized f...
I. Salam, M. El Mohajir, A. Taleb, B. El Mohajir
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 11 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer