Sciweavers

350 search results - page 58 / 70
» Lower bounds and heuristic algorithms for the k
Sort
View
SIAMCOMP
2000
161views more  SIAMCOMP 2000»
14 years 9 months ago
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
CORR
2007
Springer
134views Education» more  CORR 2007»
14 years 9 months ago
Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
Masoud Ebrahimi, Amir K. Khandani
73
Voted
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
15 years 2 months ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...
85
Voted
CIKM
2011
Springer
13 years 9 months ago
Lower-bounding term frequency normalization
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
Yuanhua Lv, ChengXiang Zhai
COCOON
2005
Springer
15 years 3 months ago
Promised and Distributed Quantum Search
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
Shengyu Zhang