Results 1 - 10 of 20,584

Sampling in Space Restricted Settings

by Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
"... Abstract. Space efficient algorithms play a central role in dealing with large amount of data. In such settings, one would like to analyse the large data using small amount of “working space”. One of the key steps in many algorithms for analysing large data is to maintain a (or a small number) rando ..."
Abstract - Add to MetaCart
) random sample from the data points. In this paper, we consider two space restricted settings – (i) streaming model, where data arrives over time and one can use only a small amount of storage, and (ii) query model, where we can structure the data in low space and answer sampling queries. In this paper

interventions in infrastructure-restricted settings

by Robert Dreibelbis, Peter J Winch, Elli Leontsini, Kristyna Rs Hull, Pavani K Ram, Leanne Unicomb, Stephen P Luby
"... behavioural models and a framework for Results: We identified 15 WASH-specific theoretical models, behaviour change frameworks, or programmatic Dreibelbis et al. BMC Public Health 2013, 13:1015 ..."
Abstract - Add to MetaCart
behavioural models and a framework for Results: We identified 15 WASH-specific theoretical models, behaviour change frameworks, or programmatic Dreibelbis et al. BMC Public Health 2013, 13:1015

A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection

by Ron Kohavi - INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE , 1995
"... We review accuracy estimation methods and compare the two most common methods: cross-validation and bootstrap. Recent experimental results on artificial data and theoretical results in restricted settings have shown that for selecting a good classifier from a set of classifiers (model selection), te ..."
Abstract - Cited by 1283 (11 self) - Add to MetaCart
We review accuracy estimation methods and compare the two most common methods: cross-validation and bootstrap. Recent experimental results on artificial data and theoretical results in restricted settings have shown that for selecting a good classifier from a set of classifiers (model selection

Compositions of pattern restricted sets of permutations

by M. H. Albert, M. D. Atkinson, H. P. Van Ditmarsch, C. C. Handley , R. E. L. Aldred, D. A. Holton, D. J. McCaughan , 2004
"... The composition of two pattern restricted classes X,Y is the set of all permutation products ## where # X,# Y . This set is also defined by pattern restrictions. Examples are given where this set of restrictions is finite and where it is infinite. The composition operation is studied in te ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
The composition of two pattern restricted classes X,Y is the set of all permutation products ## where # X,# Y . This set is also defined by pattern restrictions. Examples are given where this set of restrictions is finite and where it is infinite. The composition operation is studied

Compositions of pattern restricted sets of permutations

by Ley D. A. Holton, D. J. Mccaughan , 2004
"... The composition of two pattern restricted classes X, Y is the set of all permutation products θφ where θ ∈ X, φ ∈ Y. This set is also defined by pattern restrictions. Examples are given where this set of restrictions is finite and where it is infinite. The composition operation is studied in terms o ..."
Abstract - Add to MetaCart
The composition of two pattern restricted classes X, Y is the set of all permutation products θφ where θ ∈ X, φ ∈ Y. This set is also defined by pattern restrictions. Examples are given where this set of restrictions is finite and where it is infinite. The composition operation is studied in terms

Fast approximate energy minimization via graph cuts

by Yuri Boykov, Olga Veksler, Ramin Zabih - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2001
"... In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when v ..."
Abstract - Cited by 2120 (61 self) - Add to MetaCart
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when

Some optimal inapproximability results

by Johan Håstad , 2002
"... We prove optimal, up to an arbitrary ffl? 0, inapproximability results for Max-Ek-Sat for k * 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds for ..."
Abstract - Cited by 751 (11 self) - Add to MetaCart
We prove optimal, up to an arbitrary ffl? 0, inapproximability results for Max-Ek-Sat for k * 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds

An analysis of transformations

by G. E. P. Box, D. R. Cox - Journal of the Royal Statistical Society. Series B (Methodological , 1964
"... In the analysis of data it is often assumed that observations y,, y,,...,y, are independently normally distributed with constant variance and with expectations specified by a model linear in a set of parameters 0. In this paper we make the less restrictive assumption that such a normal, homoscedasti ..."
Abstract - Cited by 1067 (3 self) - Add to MetaCart
In the analysis of data it is often assumed that observations y,, y,,...,y, are independently normally distributed with constant variance and with expectations specified by a model linear in a set of parameters 0. In this paper we make the less restrictive assumption that such a normal

Muscle: multiple sequence alignment with high accuracy and high throughput

by Robert C. Edgar - NUCLEIC ACIDS RES , 2004
"... We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the logexpectation score, and refinement using tree-dependent r ..."
Abstract - Cited by 2509 (7 self) - Add to MetaCart
-dependent restricted partitioning. The speed and accuracy of MUSCLE are compared with T-Coffee, MAFFT and CLUSTALW on four test sets of reference alignments: BAliBASE, SABmark, SMART and a new benchmark, PREFAB. MUSCLE achieves the highest, or joint highest, rank in accuracy on each of these sets. Without refinement

Querying Heterogeneous Information Sources Using Source Descriptions

by Alon Levy, Anand Rajaraman, Joann Ordille , 1996
"... We witness a rapid increase in the number of structured information sources that are available online, especially on the WWW. These sources include commercial databases on product information, stock market information, real estate, automobiles, and entertainment. We would like to use the data stored ..."
Abstract - Cited by 724 (34 self) - Add to MetaCart
-featured database systems and can answer only a small set of queries over their data (for example, forms on the WWW restrict the set of queries one can ask). (3) Since the number of sources is very large, effective techniques are needed to prune the set of information sources accessed to answer a query. (4
Results 1 - 10 of 20,584