Sciweavers

397 search results - page 50 / 80
» Towards Polynomial Lower Bounds for Dynamic Problems
Sort
View
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
14 years 3 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
CGF
2000
81views more  CGF 2000»
13 years 10 months ago
Generating Consistent Motion Transition via Decoupled Framespace Interpolation
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
Golam Ashraf, Kok Cheong Wong
VLDB
2007
ACM
197views Database» more  VLDB 2007»
14 years 10 months ago
Indexable PLA for Efficient Similarity Search
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
Qiuxia Chen, Lei Chen 0002, Xiang Lian, Yunhao Liu...
IROS
2007
IEEE
149views Robotics» more  IROS 2007»
14 years 4 months ago
A decentralized planner that guarantees the safety of communicating vehicles with complex dynamics that replan online
— This paper considers the problem of coordinating multiple vehicles with kinodynamic constraints that operate in the same partially-known environment. The vehicles are able to c...
Kostas E. Bekris, Konstantinos I. Tsianos, Lydia E...
IGIS
1994
156views GIS» more  IGIS 1994»
14 years 2 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six