Sciweavers

7228 search results - page 147 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
127
Voted
ALT
2008
Springer
16 years 18 days ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
110
Voted
WWW
2007
ACM
16 years 4 months ago
Adaptive record extraction from web pages
We describe an adaptive method for extracting records from web pages. Our algorithm combines a weighted tree matching metric with clustering for obtaining data extraction patterns...
Justin Park, Denilson Barbosa
132
Voted
IUI
2010
ACM
15 years 10 months ago
From documents to tasks: deriving user tasks from document usage patterns
A typical knowledge worker is involved in multiple tasks and switches frequently between them every work day. These frequent switches become expensive because each task switch req...
Oliver Brdiczka
132
Voted
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 3 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
111
Voted
ISAAC
1999
Springer
70views Algorithms» more  ISAAC 1999»
15 years 8 months ago
Multiple Spin-Block Decisions
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...
Peter Damaschke