Sciweavers

7930 search results - page 1479 / 1586
» Greedy in Approximation Algorithms
Sort
View
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 6 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
ICCV
2011
IEEE
14 years 3 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
158
Voted
AAAI
2011
14 years 3 months ago
Combining Learned Discrete and Continuous Action Models
Action modeling is an important skill for agents that must perform tasks in novel domains. Previous work on action modeling has focused on learning STRIPS operators in discrete, r...
Joseph Z. Xu, John E. Laird
CRV
2011
IEEE
278views Robotics» more  CRV 2011»
14 years 3 months ago
Online Visual Vocabularies
Abstract—The idea of an online visual vocabulary is proposed. In contrast to the accepted strategy of generating vocabularies offline, using the k-means clustering over all the ...
Yogesh A. Girdhar, Gregory Dudek
EMNLP
2011
14 years 3 months ago
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
Ni Lao, Tom M. Mitchell, William W. Cohen
« Prev « First page 1479 / 1586 Last » Next »