Sciweavers

556 search results - page 22 / 112
» A Comparative Study of Some Generalized Rough Approximations
Sort
View
QUESTA
2010
131views more  QUESTA 2010»
15 years 5 days ago
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
Maaike Verloop, R. Núñez Queija
109
Voted
ASSETS
2007
ACM
15 years 5 months ago
Corpus studies in word prediction
Word prediction can be used to enhance the communication rate of people with disabilities who use Augmentative and Alternative Communication (AAC) devices. We use statistical meth...
Keith Trnka, Kathleen F. McCoy
163
Voted
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
15 years 3 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
120
Voted
SPAA
2010
ACM
15 years 6 months ago
Parallel approximation algorithms for facility-location problems
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
Guy E. Blelloch, Kanat Tangwongsan
RECONFIG
2009
IEEE
182views VLSI» more  RECONFIG 2009»
15 years 8 months ago
Scalability Studies of the BLASTn Scan and Ungapped Extension Functions
BLASTn is a ubiquitous tool used for large scale DNA analysis. Detailed profiling tests reveal that the most computationally intensive sections of the BLASTn algorithm are the sc...
Siddhartha Datta, Ron Sass