Sciweavers

6546 search results - page 15 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
TIT
2008
74views more  TIT 2008»
13 years 8 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
SIGIR
2006
ACM
14 years 2 months ago
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
Oren Kurland, Lillian Lee
AAAI
2000
13 years 10 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
TSMC
2008
222views more  TSMC 2008»
13 years 8 months ago
Improving Iris Recognition Performance Using Segmentation, Quality Enhancement, Match Score Fusion, and Indexing
Abstract--This paper proposes algorithms for iris segmentation, quality enhancement, match score fusion, and indexing to improve both the accuracy and the speed of iris recognition...
Mayank Vatsa, Richa Singh, Afzel Noore
IPPS
2005
IEEE
14 years 2 months ago
Improving and Stabilizing Parallel Computer Performance Using Adaptive Backfilling
The scheduler is a key component in determining the overall performance of a parallel computer, and as we show here, the schedulers in wide use today exhibit large unexplained gap...
David Talby, Dror G. Feitelson