2252 search results - page 202 / 451 » Improving Random Forests |
103
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...
134
click to vote
DAM
2008
15 years 3 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
190
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
116
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...
136
Voted
ACL
2010
15 years 1 months ago
2010
Determining the semantic intent of web queries not only involves identifying their semantic class, which is a primary focus of previous works, but also understanding their semanti...