Sciweavers

6202 search results - page 289 / 1241
» Without Loss of Generality
Sort
View
KDD
2008
ACM
182views Data Mining» more  KDD 2008»
16 years 7 months ago
Classification with partial labels
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
Nam Nguyen, Rich Caruana
KDD
2008
ACM
202views Data Mining» more  KDD 2008»
16 years 7 months ago
Data and Structural k-Anonymity in Social Networks
The advent of social network sites in the last years seems to be a trend that will likely continue. What naive technology users may not realize is that the information they provide...
Alina Campan, Traian Marius Truta
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
16 years 7 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 7 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
MOBIHOC
2006
ACM
16 years 6 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...