Sciweavers

4767 search results - page 21 / 954
» Moving between Contexts
Sort
View
ESA
2003
Springer
58views Algorithms» more  ESA 2003»
14 years 1 months ago
Kinetic Dictionaries: How to Shoot a Moving Target
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
Mark de Berg
WOA
2003
13 years 9 months ago
Filling the Gap Between Users and Objects: a Multichannel Interactive Environment
— The design and the implementation of software for mobile computers and for pervasive computing environments entail several issues and lead to new requirements. Applications mus...
Davide Carboni, Andrea Piras, Stefano Sanna, Gavin...
GIS
2002
ACM
13 years 8 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
FS
2010
162views more  FS 2010»
13 years 7 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
CHI
1999
ACM
14 years 24 days ago
The Context Toolkit: Aiding the Development of Context-Enabled Applications
Context-enabled applications are just emerging and promise richer interaction by taking environmental context into account. However, they are difficult to build due to their distr...
Daniel Salber, Anind K. Dey, Gregory D. Abowd