Sciweavers

1538 search results - page 245 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
102
Voted
IROS
2007
IEEE
156views Robotics» more  IROS 2007»
15 years 7 months ago
Learning maps in 3D using attitude and noisy vision sensors
— In this paper, we address the problem of learning 3D maps of the environment using a cheap sensor setup which consists of two standard web cams and a low cost inertial measurem...
Bastian Steder, Giorgio Grisetti, Slawomir Grzonka...
SAC
2005
ACM
15 years 7 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
15 years 6 months ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
MICRO
1997
IEEE
141views Hardware» more  MICRO 1997»
15 years 5 months ago
Unroll-and-Jam Using Uniformly Generated Sets
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
Steve Carr, Yiping Guan
JAL
1998
85views more  JAL 1998»
15 years 1 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay