1013 search results - page 183 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
139
Voted
CORR
1999
Springer
14 years 9 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
133
Voted
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—We propose a routing metric for enabling highthroughput reliable multicast in multi-rate wireless mesh networks. This new multicast routing metric, called expected multi...
110
click to vote
PODC
2012
ACM
13 years 3 days ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
ECCV
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...