Sciweavers

5785 search results - page 822 / 1157
» Approximability of Probability Distributions
Sort
View
185
Voted
FOCS
2000
IEEE
15 years 11 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
VLDB
1987
ACM
90views Database» more  VLDB 1987»
15 years 10 months ago
Index Access with a Finite Buffer
: A buffer is a main-memory area used to reduce accessto disks. The buffer holds pages from secondary storage files. A processrequesting a page causesa fault if the pageis not in t...
Giovanni Maria Sacco
EMNLP
2007
15 years 8 months ago
Detecting Compositionality of Verb-Object Combinations using Selectional Preferences
In this paper we explore the use of selectional preferences for detecting noncompositional verb-object combinations. To characterise the arguments in a given grammatical relations...
Diana McCarthy, Sriram Venkatapathy, Aravind K. Jo...
AAAI
2000
15 years 8 months ago
Recognizing End-User Transactions in Performance Management
Providing good quality of service (e.g., low response times) in distributed computer systems requires measuring enduser perceptions of performance. Unfortunately, such measures ar...
Joseph L. Hellerstein, T. S. Jayram, Irina Rish
SPAA
2010
ACM
15 years 6 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis