Sciweavers

3359 search results - page 291 / 672
» A Simplified Idea Algorithm
Sort
View
JACM
2006
98views more  JACM 2006»
15 years 3 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 3 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
15 years 1 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
150
Voted
IWPEC
2010
Springer
15 years 1 months ago
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
Jesper Nederlof, Johan M. M. van Rooij
TON
2010
126views more  TON 2010»
14 years 10 months ago
Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks
In this paper, we present a novel multiperiod spraying algorithm for routing in delay-tolerant networks (DTNs). The goal is to minimize the average copy count used per message unti...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski