Sciweavers

1282 search results - page 4 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Building Sparse Large Margin Classifiers
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
Bernhard Schölkopf, Gökhan H. Bakir, Min...
ICANN
2007
Springer
13 years 11 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
MOBICOM
2012
ACM
11 years 10 months ago
Faster GPS via the sparse fourier transform
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr ...
IOR
2011
175views more  IOR 2011»
13 years 2 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
FCCM
2006
IEEE
113views VLSI» more  FCCM 2006»
14 years 1 months ago
GraphStep: A System Architecture for Sparse-Graph Algorithms
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
Michael DeLorimier, Nachiket Kapre, Nikil Mehta, D...