Sciweavers

840 search results - page 140 / 168
» The Complexity of the Extended GCD Problem
Sort
View
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 11 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
INFOCOM
2010
IEEE
13 years 7 months ago
Asymmetry-Aware Real-Time Distributed Joint Resource Allocation in IEEE 802.22 WRANs
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
Hyoil Kim, Kang G. Shin
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 10 months ago
Adaptive Segmentation for Scientific Databases
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
Milena Ivanova, Martin L. Kersten, Niels Nes
CHI
2007
ACM
14 years 9 months ago
Work-centered design: a case study of a mixed-initiative scheduler
We present the case study of a complex, mixed-initiative scheduling system to illustrate Work-Centered Design (WCD), a new approach for the design of information systems. WCD is b...
Keith A. Butler, Jiajie Zhang, Chris Esposito, Ali...
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
14 years 3 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...