Sciweavers

3047 search results - page 20 / 610
» Randomized Parallel Selection
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 7 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
CVPR
2008
IEEE
14 years 9 months ago
Selective hidden random fields: Exploiting domain-specific saliency for event classification
Classifying an event captured in an image is useful for understanding the contents of the image. The captured event provides context to refine models for the presence and appearan...
Vidit Jain, Amit Singhal, Jiebo Luo
TPDS
1998
76views more  TPDS 1998»
13 years 7 months ago
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
Sanguthevar Rajasekaran, Sartaj Sahni
ICML
1994
IEEE
13 years 11 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
TWC
2008
133views more  TWC 2008»
13 years 7 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...