Sciweavers

282 search results - page 50 / 57
» An efficient algorithm in the HLA time management
Sort
View
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 8 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
CF
2007
ACM
13 years 11 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 7 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
DATE
2002
IEEE
84views Hardware» more  DATE 2002»
14 years 20 days ago
Highly Scalable Dynamically Reconfigurable Systolic Ring-Architecture for DSP Applications
Microprocessors are today getting more and more inefficient for a growing range of applications. Its principles -The Von Neumann paradigm[3]- based on the sequential execution of ...
Gilles Sassatelli, Lionel Torres, Pascal Benoit, T...
AIPS
2010
13 years 8 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger