4013 search results - page 730 / 803 » computing 2002 |
224
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
129
click to vote
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
The widespread distribution and availability of smallscale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such examp...
131
click to vote
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
We examine two aspects concerning the influence of unidirectional links on routing performance in multihop wireless networks. In the first part of the paper, we evaluate the benef...
138
Voted
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
112
click to vote
CIVR
2007
Springer
15 years 8 months ago
2007
Springer
Automatic image annotation automatically labels image content with semantic keywords. For instance, the Relevance Model estimates the joint probability of the keyword and the imag...