Sciweavers

2031 search results - page 141 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
NIPS
2003
14 years 11 months ago
A Holistic Approach to Compositional Semantics: A Connectionist Model and Robot Experiments
We present a novel connectionist model for acquiring the semantics of a simple language through the behavioral experiences of a real robot. We focus on the “compositionality” ...
Yuuya Sugita, Jun Tani
MVA
1998
149views Computer Vision» more  MVA 1998»
14 years 11 months ago
Auto-Calibration of a Rotating and Zooming Camera
We propose a method to calibrate a rotating and zooming camera without 3D pattern, where the internal parameters change frame by frame. First, we show that the calibration is uniq...
Yongduek Seo, Ki-Sang Hong
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
14 years 11 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
TREC
2000
14 years 11 months ago
Information Space Based on HTML Structure
The main goal for the Information Space system for TREC9 was early precision. To facilitate this, an emphasis was placed on seeking matches from only the TITLE, H1, H2 and H3 tags...
Gregory B. Newby
WSC
1997
14 years 11 months ago
Seven Habits of Highly Successful Input Modelers
Discrete-event simulation models typically have stochastic components that mimic the probabilistic nature of the system under consideration. Successful input modeling requires a c...
Lawrence Leemis