Sciweavers

5595 search results - page 760 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
IJCAI
2007
15 years 8 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
15 years 7 months ago
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
Emmanouil Pountourakis, Angelina Vidali
PR
2000
130views more  PR 2000»
15 years 6 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan
TFS
2008
94views more  TFS 2008»
15 years 6 months ago
Hierarchical Fuzzy CMAC for Nonlinear Systems Modeling
Abstract--Since the fuzzy cerebellar model articulation controller (FCMAC) uses linguistic variables, it is highly intuitive and easily comprehended. Despite the FCMAC's good ...
Wen Yu, Floriberto Ortiz Rodriguez, Marco A. Moren...
CORR
2011
Springer
176views Education» more  CORR 2011»
15 years 1 months ago
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...
Cong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehl&...