420 search results - page 73 / 84 » Some Algorithmic Problems in Polytope Theory |
80
Voted
SIAMAM
2011
14 years 4 months ago
2011
We consider the problem of locating perfectly conducting cracks and estimating their geometric features from multi-static response matrix measurements at a single or multiple frequ...
105
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
110
click to vote
PODC
2012
ACM
13 years 2 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...