Sciweavers

2745 search results - page 427 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ASPLOS
1994
ACM
15 years 8 months ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
SDM
2007
SIAM
131views Data Mining» more  SDM 2007»
15 years 6 months ago
Load Shedding in Classifying Multi-Source Streaming Data: A Bayes Risk Approach
In many applications, we monitor data obtained from multiple streaming sources for collective decision making. The task presents several challenges. First, data in sensor networks...
Yijian Bai, Haixun Wang, Carlo Zaniolo
BMCBI
2008
131views more  BMCBI 2008»
15 years 4 months ago
CoCoNUT: an efficient system for the comparison and analysis of genomes
Background: Comparative genomics is the analysis and comparison of genomes from different species. This area of research is driven by the large number of sequenced genomes and hea...
Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohl...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
CAV
2009
Springer
187views Hardware» more  CAV 2009»
16 years 5 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann