831 search results - page 3 / 167 » Finding Minimum Data Requirements Using Pseudo-independence |
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
RE
2005
Springer
14 years 1 months ago
2005
Springer
Defect reports generated for faults found during testing provide a rich source of information regarding problematic phrases used in requirements documents. These reports indicate ...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Existing 3D clustering algorithms on gene ? sample ? time expression data do not consider the time lags between correlated gene expression patterns. Besides, they either ignore the...