Sciweavers

392 search results - page 34 / 79
» A unified framework for generalized Linear Discriminant Anal...
Sort
View
ICALP
2000
Springer
14 years 20 days ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
VLSISP
2010
106views more  VLSISP 2010»
13 years 7 months ago
A Multi-Pronged Approach to Improving Semantic Extraction of News Video
In this paper we describe a multi-strategy approach to improving semantic extraction from news video. Experiments show the value of careful parameter tuning, exploiting multiple fe...
Alexander G. Hauptmann, Ming-yu Chen, Michael G. C...
AIM
2006
13 years 9 months ago
Comparative Analysis of Frameworks for Knowledge-Intensive Intelligent Agents
maintain awareness of its environment for a long period of time. Additionally, knowledge-intensive agents must be engineered such that their knowledge can be easily updated as envi...
Randolph M. Jones, Robert E. Wray III
ECCV
2010
Springer
14 years 2 months ago
Analysis of Motion Blur With a Flutter Shutter Camera for Non-Linear Motion
Motion blurs confound many computer vision problems. The fluttered shutter (FS) camera [1] tackles the motion deblurring problem by emulating invertible broadband blur kernels. How...
Yuanyuan Ding, Scott McCloskey, Jingyi Yu
MP
1998
109views more  MP 1998»
13 years 8 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra