Sciweavers

725 search results - page 48 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
DCOSS
2008
Springer
14 years 11 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 2 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
103
Voted
NIPS
1997
14 years 11 months ago
Learning to Order Things
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
William W. Cohen, Robert E. Schapire, Yoram Singer
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 6 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...