Sciweavers

27 search results - page 5 / 6
» Interval Stabbing Problems in Small Integer Ranges
Sort
View
83
Voted
IJCAI
1989
14 years 11 months ago
Perturbation Analysis with Qualitative Models
Perturbation analysis deals with the relation­ ships between small changes in a system's inputs or model and changes in its outputs. Reverse simulation is of particular inte...
Renato de Mori, Robert Prager
TSMC
2002
107views more  TSMC 2002»
14 years 9 months ago
Guaranteed robust nonlinear estimation with application to robot localization
When reliable prior bounds on the acceptable errors between the data and corresponding model outputs are available, bounded-error estimation techniques make it possible to characte...
Luc Jaulin, Michel Kieffer, Eric Walter, Dominique...
PVLDB
2010
149views more  PVLDB 2010»
14 years 8 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
FOCS
2008
IEEE
15 years 4 months ago
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
Yefim Dinitz, Michael Elkin, Shay Solomon
88
Voted
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
14 years 9 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth