Sciweavers

3604 search results - page 115 / 721
» All Common Subsequences
Sort
View
RSA
2011
102views more  RSA 2011»
14 years 11 months ago
Dependent random choice
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
Jacob Fox, Benny Sudakov
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
16 years 5 months ago
Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking
OLTP and transactional workloads are increasingly common in computer systems, ranging from ecommerce to warehousing to inventory management. It is valuable to provide priority sch...
David T. McWherter, Bianca Schroeder, Anastassia A...
SIGIR
2009
ACM
15 years 10 months ago
Score adjustment for correction of pooling bias
Information retrieval systems are evaluated against test collections of topics, documents, and assessments of which documents are relevant to which topics. Documents are chosen fo...
William Webber, Laurence A. F. Park
WOSP
2005
ACM
15 years 9 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills
DAC
2000
ACM
15 years 8 months ago
Using general-purpose programming languages for FPGA design
ct General-purpose programming languages (GPL) are effective vehicles for FPGA design because they are easy to use, extensible, widely available, and can be used to describe both t...
Brad L. Hutchings, Brent E. Nelson