Sciweavers

11384 search results - page 312 / 2277
» Achieved IPC Performance
Sort
View
STOC
1993
ACM
87views Algorithms» more  STOC 1993»
14 years 2 months ago
How to use expert advice
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
Nicolò Cesa-Bianchi, Yoav Freund, David P. ...
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
14 years 2 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
NIPS
2001
14 years 4 days ago
Fast and Robust Classification using Asymmetric AdaBoost and a Detector Cascade
This paper develops a new approach for extremely fast detection in domains where the distribution of positive and negative examples is highly skewed (e.g. face detection or databa...
Paul A. Viola, Michael J. Jones
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 3 days ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
JSAC
2006
78views more  JSAC 2006»
13 years 10 months ago
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
Abstract--Although the capacity of multiple-input/multipleoutput (MIMO) broadcast channels (BCs) can be achieved by dirty paper coding (DPC), it is difficult to implement in practi...
Taesang Yoo, Andrea J. Goldsmith