2168 search results - page 163 / 434 » Randomized Algorithms and Complexity Theory |
116
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
112
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
114
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
136
Voted
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
147
Voted
ACAL
2009
Springer
15 years 10 months ago
2009
Springer
The Information Fusion Panel within The Technical Cooperation Program (TTCP) is developing algorithms to perform machine-based situation assessment to assist human operators in co...