2252 search results - page 303 / 451 » Improving Random Forests |
123
click to vote
ASPLOS
2008
ACM
15 years 2 months ago
2008
ACM
Memory errors are a notorious source of security vulnerabilities that can lead to service interruptions, information leakage and unauthorized access. Because such errors are also ...
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
144
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
113
Voted
ALENEX
2010
15 years 2 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
113
Voted
OPODIS
2007
15 years 2 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....