3341 search results - page 489 / 669 » On Bounded Queries and Approximation |
175
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
144
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
226
click to vote
PEPM
1995
ACM
15 years 10 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
160
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
181
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...