Sciweavers

2107 search results - page 255 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
RSS
2007
128views Robotics» more  RSS 2007»
13 years 10 months ago
Data Association in O(n) for Divide and Conquer SLAM
—In this paper we show that all processes associated to the move-sense-update cycle of EKF SLAM can be carried out in time linear in the number of map features. We describe Divid...
Lina María Paz, José E. Guivant, Jua...
AAAI
1998
13 years 10 months ago
A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms
Walsh Transforms measure all sources of nonlinear interactions for functions that have a bit representation. There can be exponentially many nonlinear interactions and exactly com...
Soraya B. Rana, Robert B. Heckendorn, L. Darrell W...
IPPS
2007
IEEE
14 years 3 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...
RTA
2005
Springer
14 years 2 months ago
Open. Closed. Open
Abstract. As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewrit...
Nachum Dershowitz
BMCBI
2007
136views more  BMCBI 2007»
13 years 9 months ago
Genomorama: genome visualization and analysis
Background: The ability to visualize genomic features and design experimental assays that can target specific regions of a genome is essential for modern biology. To assist in the...
Jason D. Gans, Murray Wolinsky