324 search results - page 23 / 65 » Bounds for Functions of Dependent Risks |
COLT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
144
click to vote
RTSS
1994
IEEE
15 years 4 months ago
1994
IEEE
The use of caches poses a difficult tradeoff for architects of real-time systems. While caches provide significant performance advantages, they have also been viewed as inherently...
PODS
2006
ACM
15 years 12 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
110
click to vote
TDSC
2010
14 years 6 months ago
2010
Although recent estimates are speaking of 200,000 different viruses, worms, and Trojan horses, the majority of them are variants of previously existing malware. As these variants m...
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...