Sciweavers

2957 search results - page 416 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
BDA
2007
15 years 7 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
AI
2010
Springer
15 years 6 months ago
Updating action domain descriptions
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 6 months ago
Decision Making with Side Information and Unbounded Loss Functions
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
Majid Fozunbal, Ton Kalker
IJCSA
2006
121views more  IJCSA 2006»
15 years 6 months ago
Evaluation of the RC4 Algorithm for Data Encryption
Analysis of the effect of different parameters of the RC4 encryption algorithm where examined. Some experimental work was performed to illustrate the performance of this algorithm...
Allam Mousa, Ahmad Hamad
157
Voted
IJCV
2006
116views more  IJCV 2006»
15 years 6 months ago
Contextual Inference in Contour-Based Stereo Correspondence
Standard approaches to stereo correspondence have difficulty when scene structure does not lie in or near the frontal parallel plane, in part because an orientation disparity as we...
Gang Li, Steven W. Zucker