Sciweavers

5169 search results - page 60 / 1034
» Locality approximation using time
Sort
View
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
15 years 9 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
AGENTS
1997
Springer
15 years 6 months ago
Progressive Negotiation For Time-Constrained Autonomous Agents
We address in this paper a problem of autonomous agents performing in a common environment where each agent has its goal to achieve before a given deadline. Agents must be able to...
Abdel-Illah Mouaddib
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
15 years 8 months ago
Analysis of Time Series Using Compact Model-Based Descriptions
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 2 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
ACCV
2009
Springer
15 years 9 months ago
Image-Set Based Face Recognition Using Boosted Global and Local Principal Angles
Face recognition using image-set or video sequence as input tends to be more robust since image-set or video sequence provides much more information than single snapshot about the ...
Xi Li, Kazuhiro Fukui, Nanning Zheng