5326 search results - page 356 / 1066 » On what we can ensure |
211
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
147
click to vote
ESOP
2009
Springer
16 years 1 months ago
2009
Springer
ion for Concurrent Objects Ivana Filipovi´c, Peter O’Hearn, Noam Rinetzky, and Hongseok Yang Queen Mary University of London, UK Concurrent data structures are usually designed ...
200
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—Wireless ad hoc networks are connected to the fixed Internet by means of Internet gateways. Whenever a node within the ad hoc network wishes to communicate with a host in the I...
169
click to vote
ICTIR
2009
Springer
16 years 1 months ago
2009
Springer
We address the problem of online term recurrence prediction: for a stream of terms, at each time point predict what term is going to recur next in the stream given the term occurre...
169
click to vote
MHCI
2009
Springer
16 years 1 months ago
2009
Springer
Most mobile navigation systems focus on answering the question, “I know where I want to go, now can you show me exactly how to get there?” While this approach works well for m...