Sciweavers

5954 search results - page 1171 / 1191
» Querying Bi-level Information
Sort
View
PLDI
2010
ACM
14 years 1 months ago
Detecting Inefficiently-Used Containers to Avoid Bloat
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...
Guoqing Xu, Atanas Rountev
FODO
1993
Springer
110views Algorithms» more  FODO 1993»
14 years 1 months ago
Storage System Architectures for Continuous Media Data
Abstract. Data storage systems are being called on to manage continuous media data types, such as digital audio and video. There is a demand by applications for \constrained-latenc...
David Maier, Jonathan Walpole, Richard Staehli
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 1 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ACMICEC
2007
ACM
154views ECommerce» more  ACMICEC 2007»
14 years 1 months ago
Learning and adaptivity in interactive recommender systems
Recommender systems are intelligent E-commerce applications that assist users in a decision-making process by offering personalized product recommendations during an interaction s...
Tariq Mahmood, Francesco Ricci
FOCS
2004
IEEE
14 years 1 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
« Prev « First page 1171 / 1191 Last » Next »