Sciweavers

2996 search results - page 370 / 600
» Numberings and Randomness
Sort
View
TNN
2010
143views Management» more  TNN 2010»
15 years 1 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 10 months ago
Downlink SDMA with Limited Feedback in Interference-Limited Wireless Networks
The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast chann...
Marios Kountouris, Jeffrey G. Andrews
COMPGEOM
2011
ACM
14 years 10 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
ICALP
2011
Springer
14 years 10 months ago
Clustering with Local Restrictions
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
Daniel Lokshtanov, Dániel Marx
INFOCOM
2011
IEEE
14 years 10 months ago
SelectCast: Scalable data aggregation scheme in wireless sensor networks
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
Cheng Wang, ShaoJie Tang, Xiang-Yang Li, Changjun ...