Sciweavers

1185 search results - page 153 / 237
» The Equivalence of Sampling and Searching
Sort
View
IJNSEC
2008
210views more  IJNSEC 2008»
13 years 7 months ago
A Method for Locating Digital Evidences with Outlier Detection Using Support Vector Machine
One of the biggest challenges facing digital investigators is the sheer volume of data that must be searched in locating the digital evidence. How to efficiently locate the eviden...
Zaiqiang Liu, Dongdai Lin, Fengdeng Guo
INFORMS
2008
62views more  INFORMS 2008»
13 years 7 months ago
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
We present a stochastic approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of...
Huseyin Topaloglu
JSAT
2008
85views more  JSAT 2008»
13 years 7 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
JMLR
2006
113views more  JMLR 2006»
13 years 7 months ago
Learning the Structure of Linear Latent Variable Models
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
Ricardo Silva, Richard Scheines, Clark Glymour, Pe...
CSDA
2004
81views more  CSDA 2004»
13 years 7 months ago
A note on split selection bias in classification trees
A common approach to split selection in classification trees is to search through all possible splits generated by predictor variables. A splitting criterion is then used to evalu...
Y.-S. Shih