Sciweavers

2262 search results - page 438 / 453
» Points with large quadrant-depth
Sort
View
IJCV
2002
188views more  IJCV 2002»
14 years 11 months ago
Scalable Extrinsic Calibration of Omni-Directional Image Networks
We describe a linear-time algorithm that recovers absolute camera orientations and positions, along with uncertainty estimates, for networks of terrestrial image nodes spanning hun...
Matthew E. Antone, Seth J. Teller
JCB
2002
70views more  JCB 2002»
14 years 11 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
JCT
1998
68views more  JCT 1998»
14 years 11 months ago
A Note on the Trinomial Analogue of Bailey's Lemma
Recently, Andrews and Berkovich introduced a trinomial version of Bailey’s lemma. In this note we show that each ordinary Bailey pair gives rise to a trinomial Bailey pair. This ...
S. Ole Warnaar
SIAMCO
2002
121views more  SIAMCO 2002»
14 years 11 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak
TON
1998
103views more  TON 1998»
14 years 11 months ago
Using name-based mappings to increase hit rates
—Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the World Wide Web (WWW) and of...
David Thaler, Chinya V. Ravishankar