Sciweavers

1486 search results - page 88 / 298
» Algorithms for two-box covering
Sort
View
CSDA
2010
118views more  CSDA 2010»
15 years 6 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
16 years 6 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
AMOST
2005
ACM
15 years 11 months ago
Test prioritization for pairwise interaction coverage
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
AHSWN
2006
148views more  AHSWN 2006»
15 years 6 months ago
Geometric Chemotaxis: A Biologically-Inspired Framework for a Class of Wireless Coverage Problems
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
Hidayet Ozgur Sanli, Rahul Simha, Bhagirath Naraha...
CORR
2007
Springer
103views Education» more  CORR 2007»
15 years 6 months ago
Interactive Small-Step Algorithms I: Axiomatization
Abstract. In earlier work, the Abstract State Machine Thesis — that arbitrary algore behaviorally equivalent to abstract state machines — was established for several classes of...
Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Ben...