Sciweavers

3422 search results - page 31 / 685
» Random Subset Optimization
Sort
View
ICML
1996
IEEE
16 years 2 months ago
Toward Optimal Feature Selection
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
Daphne Koller, Mehran Sahami
CN
2007
148views more  CN 2007»
15 years 1 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid
FCT
2009
Springer
15 years 8 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
TIT
1998
90views more  TIT 1998»
15 years 1 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...
ICASSP
2008
IEEE
15 years 8 months ago
Performance and robustness: A trade-off in dynamic signature verification
A performance and robustness study for on-line signature veri cation is presented. Experiments are carried out on the MCYT database comprising 16,500 signatures from 330 subjects,...
Javier Galbally, Julian Fiérrez, Javier Ort...