Sciweavers

2780 search results - page 391 / 556
» Effective features of algorithm visualizations
Sort
View
WWW
2008
ACM
15 years 11 months ago
Floatcascade learning for fast imbalanced web mining
This paper is concerned with the problem of Imbalanced Classification (IC) in web mining, which often arises on the web due to the "Matthew Effect". As web IC applicatio...
Xiaoxun Zhang, Xueying Wang, Honglei Guo, Zhili Gu...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
15 years 10 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
EDBT
2004
ACM
119views Database» more  EDBT 2004»
15 years 10 months ago
NNH: Improving Performance of Nearest-Neighbor Searches Using Histograms
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
Liang Jin, Nick Koudas, Chen Li
GLOBECOM
2009
IEEE
15 years 5 months ago
The Directional Attack on Wireless Localization -or- How to Spoof Your Location with a Tin Can
—802.11 localization algorithms provide the ability to accurately position and track wireless clients thereby enabling location-based services and applications. However, we show ...
Kevin S. Bauer, Damon McCoy, Eric W. Anderson, Mar...
97
Voted
MM
2004
ACM
248views Multimedia» more  MM 2004»
15 years 3 months ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He