Sciweavers

10419 search results - page 177 / 2084
» Relational information gain
Sort
View
SIGIR
2012
ACM
13 years 9 months ago
Content-based retrieval for heterogeneous domains: domain adaptation by relative aggregation points
We introduce the problem of domain adaptation for content-based retrieval and propose a domain adaptation method based on relative aggregation points (RAPs). Content-based retriev...
Makoto P. Kato, Hiroaki Ohshima, Katsumi Tanaka
ISCIS
2009
Springer
16 years 1 months ago
Unsupervised learning of affordance relations on a humanoid robot
—In this paper, we study how a humanoid robot can learn affordance relations in his environment through its own interactions in an unsupervised way. Specifically, we developed a...
Baris Akgun, Nilgun Dag, Tahir Bilal, Ilkay Atil, ...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 10 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
15 years 10 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...
CGO
2004
IEEE
15 years 10 months ago
Exposing Memory Access Regularities Using Object-Relative Memory Profiling
Memory profiling is the process of characterizing a program's memory behavior by observing and recording its response to specific input sets. Relevant aspects of the program&...
Qiang Wu, Artem Pyatakov, Alexey Spiridonov, Easwa...