13214 search results - page 2373 / 2643 » Pseudorandomness for network algorithms |
196
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. Mobile objects have become ubiquitous in our everyday lives, ranging from cellular phones to sensors, therefore, analyzing and mining mobile data becomes an interesting p...
176
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
156
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
In today's Internet applications or sensor networks we often encounter large amounts of data spread over many physically distributed nodes. The sheer volume of the data and ba...
158
click to vote
ICCD
2007
IEEE
16 years 3 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
158
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation i...