Sciweavers

3708 search results - page 38 / 742
» Approximating Betweenness Centrality
Sort
View
CDC
2009
IEEE
159views Control Systems» more  CDC 2009»
14 years 3 months ago
A distributed machine learning framework
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
Tansu Alpcan, Christian Bauckhage
IJRR
2008
115views more  IJRR 2008»
13 years 11 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
NECO
2008
129views more  NECO 2008»
13 years 11 months ago
Sparse Coding via Thresholding and Local Competition in Neural Circuits
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
CORR
2011
Springer
200views Education» more  CORR 2011»
13 years 6 months ago
Optimal Channel Training in Uplink Network MIMO Systems
We consider a multi-cell frequency-selective fading uplink channel (network MIMO) from K singleantenna user terminals (UTs) to B cooperative base stations (BSs) with M antennas ea...
Jakob Hoydis, Mari Kobayashi, Mérouane Debb...
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
13 years 1 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...