Sciweavers

248 search results - page 37 / 50
» New On-Line Algorithms for the Page Replication Problem
Sort
View
AAAI
1998
15 years 1 months ago
Learning to Extract Symbolic Knowledge from the World Wide Web
The World Wide Web is a vast source of information accessible to computers, but understandable only to humans. The goal of the research described here is to automatically create a...
Mark Craven, Dan DiPasquo, Dayne Freitag, Andrew M...
PAMI
2010
207views more  PAMI 2010»
14 years 6 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 4 months ago
Optimal sampling from distributed streams
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...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 12 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
WWW
2007
ACM
16 years 11 days ago
Compare&contrast: using the web to discover comparable cases for news stories
Comparing and contrasting is an important strategy people employ to understand new situations and create solutions for new problems. Similar events can provide hints for problem s...
Jiahui Liu, Earl Wagner, Larry Birnbaum