1612 search results - page 108 / 323 » Analysing Randomized Distributed Algorithms |
129
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
138
Voted
KDD
2010
ACM
15 years 6 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
119
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
131
click to vote
SIGIR
2009
ACM
15 years 9 months ago
2009
ACM
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
122
click to vote
BROADNETS
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...