Sciweavers

1921 search results - page 22 / 385
» Stereo Without Search
Sort
View
RECOMB
1998
Springer
13 years 11 months ago
Alignments without low-scoring regions
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
Zheng Zhang 0004, Piotr Berman, Webb Miller
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
SGAI
2007
Springer
14 years 1 months ago
Can Agents Without Concepts Think? An Investigation Using a Knowledge Based System
Grid-World is a working computer model which has been used to investigate the search capabilities of artificial agents that understand the world in terms of non-conceptual content...
Nicky Moss, Adrian Hopgood, Martin Weller
ICRA
2010
IEEE
107views Robotics» more  ICRA 2010»
13 years 5 months ago
Using stereo for object recognition
— There has been significant progress recently in object recognition research, but many of the current approaches still fail for object classes with few distinctive features, an...
Scott Helmer, David G. Lowe
ICCV
2001
IEEE
14 years 9 months ago
Plan-View Trajectory Estimation with Dense Stereo Background Models
In a known environment, objects may be tracked in multiple views using a set of background models. Stereo-based models can be illumination-invariant, but often have undefined valu...
Trevor Darrell, David Demirdjian, Neal Checka, Ped...