5084 search results - page 922 / 1017 » Proving Possibility Properties |
122
click to vote
ER
2007
Springer
15 years 10 months ago
2007
Springer
It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental is...
111
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
108
click to vote
SSS
2007
Springer
15 years 10 months ago
2007
Springer
We investigate deterministic broadcasting on multiple-access channels in the framework of adversarial queuing. A protocol is stable when the number of packets stays bounded, and it...
133
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
125
click to vote
ACSC
2006
IEEE
15 years 10 months ago
2006
IEEE
Publish/subscribe systems utilize filter algorithms to determine all subscriptions matching incoming event messages. To distribute such services, subscriptions are forwarded to s...