Sciweavers

3250 search results - page 571 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ENTCS
2007
116views more  ENTCS 2007»
14 years 9 months ago
Experiments in Cost Analysis of Java Bytecode
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost rel...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
15 years 10 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
ISSTA
2000
ACM
15 years 2 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 4 days ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng