2996 search results - page 446 / 600 » Information Modeling in the Time of the Revolution |
183
click to vote
SIGIR
2006
ACM
16 years 11 days ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
213
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
165
click to vote
CTRSA
2003
Springer
15 years 11 months ago
2003
Springer
Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilien...
174
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
208
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...