Sciweavers

10148 search results - page 1954 / 2030
» Optimal sub-graphical models
Sort
View
RECOMB
2005
Springer
16 years 4 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
16 years 4 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 4 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 4 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
ICSE
2005
IEEE-ACM
16 years 4 months ago
Use of relative code churn measures to predict system defect density
Software systems evolve over time due to changes in requirements, optimization of code, fixes for security and reliability bugs etc. Code churn, which measures the changes made to...
Nachiappan Nagappan, Thomas Ball
« Prev « First page 1954 / 2030 Last » Next »