Sciweavers

4047 search results - page 704 / 810
» The Discrete Basis Problem
Sort
View
107
Voted
DAC
2003
ACM
16 years 4 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
157
Voted
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 4 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
16 years 4 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 4 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
264
Voted
VLDB
2005
ACM
149views Database» more  VLDB 2005»
16 years 4 months ago
Selectivity estimators for multidimensional range queries over real attributes
Estimating the selectivity of multidimensional range queries over real valued attributes has significant applications in data exploration and database query optimization. In this p...
Dimitrios Gunopulos, George Kollios, Vassilis J. T...