12264 search results - page 2274 / 2453 » Analysis of the rubberband algorithm |
127
click to vote
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
125
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
131
click to vote
ICDT
2010
ACM
16 years 1 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
183
click to vote
ALT
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
111
click to vote
ICCAD
2005
IEEE
16 years 27 days ago
2005
IEEE
A novel and very simple correct-by-construction top-down methodology for high-utilization mixed-size placement is presented. The PolarBear algorithm combines recursive cutsize-dri...