1806 search results - page 250 / 362 » Randomness and halting probabilities |
129
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
138
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
130
click to vote
MOBICOM
2004
ACM
15 years 9 months ago
2004
ACM
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
115
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a s...
146
click to vote
ASUNAM
2010
IEEE
15 years 5 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...