Sciweavers

1532 search results - page 196 / 307
» The Symbol Grounding Problem
Sort
View
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
ECCV
2010
Springer
15 years 9 months ago
SuperParsing: Scalable Nonparametric Image Parsing with Superpixels
This paper presents a simple and effective nonparametric approach to the problem of image parsing, or labeling image regions (in our case, superpixels produced by bottom-up segmen...
CSCW
2000
ACM
15 years 8 months ago
Expertise recommender: a flexible recommendation system and architecture
Locating the expertise necessary to solve difficult problems is a nuanced social and collaborative problem. In organizations, some people assist others in locating expertise by ma...
David W. McDonald, Mark S. Ackerman
AFPAC
1997
Springer
151views Mathematics» more  AFPAC 1997»
15 years 8 months ago
Trilinear Tensor: The Fundamental Construct of Multiple-view Geometry and Its Applications
The topic of representation, recovery and manipulation of three-dimensional 3D scenes from two-dimensional 2D images thereof, provides a fertile ground for both intellectual th...
Amnon Shashua
ICS
2010
Tsinghua U.
15 years 8 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell