Sciweavers

227 search results - page 38 / 46
» Approximation of the Quadratic Set Covering problem
Sort
View
KSEM
2009
Springer
14 years 1 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
TCS
2010
13 years 5 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
13 years 8 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
ICASSP
2010
IEEE
13 years 6 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega
TCS
2008
13 years 7 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri