Sciweavers

101 search results - page 4 / 21
» Automating the approximate record-matching process
Sort
View
ICRA
2006
IEEE
95views Robotics» more  ICRA 2006»
14 years 1 months ago
View Planning for Automated Site Modeling
— We present a systematic method for constructing 3-D models of large outdoor sites. The method is designed for a mobile robot platform and incorporates automated acquisition of ...
Paul Blaer, Peter K. Allen
KR
1992
Springer
13 years 11 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans
GIS
1999
ACM
13 years 11 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
FPGA
2005
ACM
215views FPGA» more  FPGA 2005»
14 years 1 months ago
Design, layout and verification of an FPGA using automated tools
Creating a new FPGA is a challenging undertaking because of the significant effort that must be spent on circuit design, layout and verification. It currently takes approximately ...
Ian Kuon, Aaron Egier, Jonathan Rose
BMCBI
2005
158views more  BMCBI 2005»
13 years 7 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney