5275 search results - page 377 / 1055 » Computing by observing |
128
Voted
BMVC
1998
15 years 6 months ago
1998
In images with low texture the performance of conventional dense stereo can be poor. The usual solution to this is to use a large window but this itself can be problematic as the ...
160
click to vote
BMVC
2000
15 years 6 months ago
2000
This paper presents a framework for directly addressing issues arising from self-occlusions and ambiguities due to the lack of depth information in vector-based representations. V...
141
Voted
NIPS
1998
15 years 6 months ago
1998
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
136
Voted
CASCON
1996
15 years 6 months ago
1996
For almost a decade we have been working at developing and using template-based models for coarse-grained parallel computing. Our initial system, FrameWorks, was positively receiv...
148
click to vote
NIPS
1994
15 years 6 months ago
1994
For many types of machine learning algorithms, one can compute the statistically optimal" way to select training data. In this paper, we review how optimal data selection tec...