Sciweavers

720 search results - page 102 / 144
» A Weighting Scheme for Star-Graphs
Sort
View
SPIRE
2004
Springer
14 years 4 months ago
Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Fraylin...
PODC
2003
ACM
14 years 4 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
DAS
2010
Springer
14 years 3 months ago
Towards more effective distance functions for word image matching
Matching word images has many applications in document recognition and retrieval systems. Dynamic Time Warping (DTW) is popularly used to estimate the similarity between word imag...
Raman Jain, C. V. Jawahar
FDTC
2006
Springer
102views Cryptology» more  FDTC 2006»
14 years 2 months ago
Non-linear Residue Codes for Robust Public-Key Arithmetic
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very hi...
Gunnar Gaubatz, Berk Sunar, Mark G. Karpovsky
SODA
1993
ACM
118views Algorithms» more  SODA 1993»
14 years 14 days ago
Scapegoat Trees
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
Igal Galperin, Ronald L. Rivest