Sciweavers

12459 search results - page 10 / 2492
» cans 2006
Sort
View
JPDC
2002
104views more  JPDC 2002»
13 years 7 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
RAS
2008
107views more  RAS 2008»
13 years 7 months ago
What can be done with an embedded stereo-rig in urban environments?
Key words: stereo-vision, mobile robotics, urban environment, super-homography, trajectography, 2.5D reconstruction PACS: I.2.9.0: Autonomous vehicles I.2.10.0: 3D/stereo scene an...
Nicolas Simond, Patrick Rives
FS
2010
162views more  FS 2010»
13 years 6 months ago
Can the implied volatility surface move by parallel shifts?
This note explores the analogy between the dynamics of the interest rate term structure and the implied volatility surface of a stock. In particular, we prove an impossibility theo...
L. C. G. Rogers, Michael Tehranchi
EXPERT
2002
103views more  EXPERT 2002»
13 years 7 months ago
How Qualitative Spatial Reasoning Can Improve Strategy Game AIs
Spatial reasoning is a major source of difficulties for strategy game AIs. We conjecture that qualitative spatial reasoning techniques can help overcome these difficulties. We bri...
Kenneth D. Forbus, James V. Mahoney, Kevin Dill
DCG
2006
69views more  DCG 2006»
13 years 7 months ago
How Neighborly Can a Centrally Symmetric Polytope Be?
Abstract. We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where k(d, n) = ,, d 1 + log((d + n)/d)
Nathan Linial, Isabella Novik