7150 search results - page 83 / 1430 » An Approximation Algorithm for Approximation Rank |
216
click to vote
ICDE
2002
IEEE
16 years 2 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
128
click to vote
WADS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
98
Voted
ASPDAC
2007
ACM
15 years 4 months ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
129
Voted
CORR
2007
Springer
15 years 17 days ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
104
click to vote
NIPS
2000
15 years 1 months ago
2000
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...