Sciweavers

893 search results - page 121 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
RAID
2004
Springer
14 years 2 months ago
Attack Analysis and Detection for Ad Hoc Routing Protocols
Abstract. Attack analysis is a challenging problem, especially in emerging environments where there are few known attack cases. One such new environment is the Mobile Ad hoc Networ...
Yi-an Huang, Wenke Lee
ICDE
2007
IEEE
146views Database» more  ICDE 2007»
14 years 24 days ago
Index-based Most Similar Trajectory Search
The problem of trajectory similarity in moving object databases is a relatively new topic in the spatial and spatiotemporal database literature. Existing work focuses on the spati...
Elias Frentzos, Kostas Gratsias, Yannis Theodoridi...
ECCV
2006
Springer
14 years 18 days ago
Segmenting Dynamic Textures with Ising Descriptors, ARX Models and Level Sets
Abstract. We present a new algorithm for segmenting a scene consisting of multiple moving dynamic textures. We model the spatial statistics of a dynamic texture with a set of secon...
Atiyeh Ghoreyshi, René Vidal
ATAL
2008
Springer
13 years 11 months ago
Robust and efficient plan recognition for dynamic multi-agent teams
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
Gita Sukthankar, Katia P. Sycara
EOR
2008
75views more  EOR 2008»
13 years 9 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist