Sciweavers

1494 search results - page 51 / 299
» Less Extreme Programming
Sort
View
EDBT
2009
ACM
104views Database» more  EDBT 2009»
14 years 9 months ago
Fair, effective, efficient and differentiated scheduling in an enterprise data warehouse
A typical online Business Intelligence (BI) workload consists of a combination of short, less intensive queries, along with long, resource intensive queries. As such, the longest ...
Chetan Gupta, Abhay Mehta, Song Wang, Umeshwar Day...
BIBE
2010
IEEE
142views Bioinformatics» more  BIBE 2010»
14 years 6 months ago
Compressed q-Gram Indexing for Highly Repetitive Biological Sequences
The study of compressed storage schemes for highly repetitive sequence collections has been recently boosted by the availability of cheaper sequencing technologies and the flood of...
Francisco Claude, Antonio Fariña, Miguel A....
IPL
2011
91views more  IPL 2011»
14 years 3 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
CGO
2008
IEEE
15 years 6 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
PERVASIVE
2010
Springer
14 years 10 months ago
LOC8: A Location Model and Extensible Framework for Programming with Location
ing model abstracts over various types of positioning systems and incorporates the capture of uncertainty, serving as a foundation on which developers can apply sensor-fusion techn...
Graeme Stevenson, Juan Ye, Simon Dobson, Paddy Nix...