1760 search results - page 284 / 352 » Connected Set Cover Problem and Its Applications |
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
DAGSTUHL
1997
13 years 9 months ago
1997
This survey presents several techniques for solving variants of the following scattered data interpolation problem: given a nite set of N points in R3, nd a surface that interpola...
MMB
2010
Springer
14 years 17 days ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. ...