Sciweavers

514 search results - page 55 / 103
» Packet Classification Algorithms: From Theory to Practice
Sort
View
ICASSP
2010
IEEE
13 years 9 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
CHI
2010
ACM
14 years 2 months ago
Motivations to participate in online communities
A consistent theoretical and practical challenge in the design of socio-technical systems is that of motivating users to participate in and contribute to them. This study examines...
Cliff Lampe, Rick Wash, Alcides Velasquez, Elif Oz...
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
14 years 3 months ago
Thoughts on solution concepts
This paper explores connections between Ficici’s notion of solution concept and order theory. Ficici postulates that algorithms should ascend an order called weak preference; th...
Anthony Bucci, Jordan B. Pollack
JMLR
2006
156views more  JMLR 2006»
13 years 8 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...
PR
2006
80views more  PR 2006»
13 years 8 months ago
Neighborhood size selection in the k-nearest-neighbor rule using statistical confidence
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this wor...
Jigang Wang, Predrag Neskovic, Leon N. Cooper