Sciweavers

15120 search results - page 279 / 3024
» Learning with Local Models
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
CVPR
2008
IEEE
16 years 1 months ago
Manifold-Manifold Distance with application to face recognition based on image set
In this paper, we address the problem of classifying image sets, each of which contains images belonging to the same class but covering large variations in, for instance, viewpoin...
Ruiping Wang, Shiguang Shan, Xilin Chen, Wen Gao
VLSISP
2010
254views more  VLSISP 2010»
15 years 5 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
SDM
2008
SIAM
119views Data Mining» more  SDM 2008»
15 years 8 months ago
An Efficient Local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks
This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments. The algorithm is designed for distributed inferencing, data compact...
Kanishka Bhaduri, Hillol Kargupta
COMCOM
2006
110views more  COMCOM 2006»
15 years 6 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak