1672 search results - page 198 / 335 » Tightness problems in the plane |
IDA
1997
Springer
15 years 3 months ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
SPAA
1993
ACM
15 years 3 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
ATAL
2006
Springer
15 years 2 months ago
2006
Springer
In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for mode...
CDC
2008
IEEE
15 years 1 months ago
2008
IEEE
We consider the role of topological dimension in problems of network consensus and vehicular formations where only local feedback is available. In particular, we consider the simpl...
NIPS
2008
15 years 19 days ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...