Sciweavers

940 search results - page 110 / 188
» Learning Word Representations from Relational Graphs
Sort
View
CVPR
2010
IEEE
15 years 12 months ago
Object-Graphs for Context-Aware Category Discovery
How can knowing about some categories help us to discover new ones in unlabeled images? Unsupervised visual category discovery is useful to mine for recurring objects without huma...
Yong Jae Lee, Kristen Grauman
130
Voted
CORR
1999
Springer
115views Education» more  CORR 1999»
15 years 3 months ago
The Symbol Grounding Problem
: There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This pa...
Stevan Harnad
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 4 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ALGORITHMICA
2005
76views more  ALGORITHMICA 2005»
15 years 3 months ago
Characterizing History Independent Data Structures
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...
Jason D. Hartline, Edwin S. Hong, Alexander E. Moh...
121
Voted
COGSCI
2010
103views more  COGSCI 2010»
15 years 3 months ago
A Computational Account of the Development of the Generalization of Shape Information
Abecassis, Sera, Yonas, and Schwade (2001) have shown that young children represent shapes more metrically, and perhaps more holistically, than do older children and adults. How d...
Leonidas A. A. Doumas, John E. Hummel