Sciweavers

5785 search results - page 993 / 1157
» Approximability of Probability Distributions
Sort
View
HPCA
2003
IEEE
16 years 4 months ago
Evaluating the Impact of Communication Architecture on the Performability of Cluster-Based Services
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
Kiran Nagaraja, Neeraj Krishnan, Ricardo Bianchini...
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 4 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 4 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
214
Voted
VLDB
2007
ACM
89views Database» more  VLDB 2007»
16 years 4 months ago
Effective Phrase Prediction
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
Arnab Nandi, H. V. Jagadish
EDBT
2006
ACM
121views Database» more  EDBT 2006»
16 years 4 months ago
On Fast Non-metric Similarity Search by Metric Access Methods
Abstract. The retrieval of objects from a multimedia database employs a measure which defines a similarity score for every pair of objects. The measure should effectively follow th...
Tomás Skopal