Sciweavers

1813 search results - page 94 / 363
» Calculi of Approximation Spaces
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
HICSS
2009
IEEE
108views Biometrics» more  HICSS 2009»
16 years 1 months ago
Approximate Dynamic Programming in Knowledge Discovery for Rapid Response
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...
Peter Frazier, Warren B. Powell, Savas Dayanik, Pa...
DSN
2009
IEEE
16 years 1 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni
ICRA
2007
IEEE
128views Robotics» more  ICRA 2007»
16 years 19 days ago
Adaptive Play Q-Learning with Initial Heuristic Approximation
Abstract— The problem of an effective coordination of multiple autonomous robots is one of the most important tasks of the modern robotics. In turn, it is well known that the lea...
Andriy Burkov, Brahim Chaib-draa
SPIRE
2007
Springer
16 years 13 days ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...