Sciweavers

1041 search results - page 35 / 209
» Randomizing Reductions of Search Problems
Sort
View
VTC
2007
IEEE
107views Communications» more  VTC 2007»
14 years 2 months ago
Random Switched Beamforming for Uplink Wireless Sensor Networks
– Integration of beamforming to sensors is very beneficial for a reduction of transmission power consumption and for improvement of the overall system performance. Unfortunately,...
Mohammed Elmusrati, Vesa Hasu
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
13 years 5 months ago
Learning an Affine Transformation for Non-linear Dimensionality Reduction
The foremost nonlinear dimensionality reduction algorithms provide an embedding only for the given training data, with no straightforward extension for test points. This shortcomin...
Pooyan Khajehpour Tadavani, Ali Ghodsi
FLAIRS
2007
13 years 10 months ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein
MSWIM
2006
ACM
14 years 1 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
11 years 10 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...