1510 search results - page 144 / 302 » Upper Probabilities and Additivity |
134
Voted
ANCS
2005
ACM
15 years 9 months ago
2005
ACM
The explosive and robust growth of the Internet owes a lot to the ”end-to-end principle”, which pushes stateful operations to the end-points. The Internet grew both in traffic...
144
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
128
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
124
click to vote
ADAEUROPE
2004
Springer
15 years 9 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
122
click to vote
AUSAI
2004
Springer
15 years 9 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....