Sciweavers

298 search results - page 44 / 60
» Forgetting and Update -- an exploration
Sort
View
CIVR
2010
Springer
299views Image Analysis» more  CIVR 2010»
13 years 9 months ago
Co-reranking by mutual reinforcement for image search
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
Ting Yao, Tao Mei, Chong-Wah Ngo
WSC
2007
13 years 9 months ago
Simulation of adaptive project management analytics
Typically, IT projects are delivered over-budget and behind schedule. In this paper, we explore the effects of common project management practices that contribute to these problem...
Léa Amandine Deleris, Sugato Bagchi, Shubir...
IJCAI
2001
13 years 8 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
SPIESR
1998
195views Database» more  SPIESR 1998»
13 years 8 months ago
Relevance Feedback Techniques in Interactive Content-Based Image Retrieval
Content-Based Image Retrieval (CBIR) has become one of the most active research areas in the past few years. Many visual feature representations have been explored and many system...
Yong Rui, Thomas S. Huang, Sharad Mehrotra
DAWAK
2010
Springer
13 years 8 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar