Sciweavers

1435 search results - page 223 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 6 months ago
New perspectives and methods in link prediction
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...
Ryan Lichtenwalter, Jake T. Lussier, Nitesh V. Cha...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 3 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
NIPS
2008
15 years 4 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
NIPS
2007
15 years 4 months ago
Cluster Stability for Finite Samples
Over the past few years, the notion of stability in data clustering has received growing attention as a cluster validation criterion in a sample-based framework. However, recent w...
Ohad Shamir, Naftali Tishby
TON
2008
86views more  TON 2008»
15 years 2 months ago
Securing user-controlled routing infrastructures
Designing infrastructures that give untrusted third parties (such as end-hosts) control over routing is a promising research direction for achieving flexible and efficient communic...
Karthik Lakshminarayanan, Daniel Adkins, Adrian Pe...