Sciweavers

9871 search results - page 1845 / 1975
» On the Structure of Low Sets
Sort
View
ASPLOS
2012
ACM
14 years 2 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...
EDBT
2012
ACM
255views Database» more  EDBT 2012»
13 years 8 months ago
Top-k spatial keyword queries on road networks
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
João B. Rocha-Junior, Kjetil Nørv&ar...
BMCBI
2010
113views more  BMCBI 2010»
15 years 6 months ago
Improving performance of mammalian microRNA target prediction
Background: MicroRNAs (miRNAs) are single-stranded non-coding RNAs known to regulate a wide range of cellular processes by silencing the gene expression at the protein and/or mRNA...
Hui Liu, Dong Yue, Yidong Chen, Shou-Jiang Gao, Yu...
BMCBI
2007
200views more  BMCBI 2007»
15 years 6 months ago
Assessment of algorithms for high throughput detection of genomic copy number variation in oligonucleotide microarray data
Background: Genomic deletions and duplications are important in the pathogenesis of diseases, such as cancer and mental retardation, and have recently been shown to occur frequent...
Ágnes Baross, Allen D. Delaney, H. Irene Li...
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
« Prev « First page 1845 / 1975 Last » Next »