Results 1 - 10 of 5,059

hood development in a second best world: Evidence from a scaled-up experiment in Cambodia. PSE Working Papers n 2014-35. 2014. <hal-01090361>

by Adrien Bouguen, Deon Filmer, Karen Macours, Sophie Naudeau, Adrien Bouguen, Deon Filmer, Karen Macours, Sophie Naudeau Preschools, Early Child, Hal Id Hal, Adrien Bouguen, Deon Filmer, Karen Macours, Sophie Naudeau , 2014
"... Preschools and early childhood development in a second best world: Evidence from a scaled-up experiment in ..."
Abstract - Add to MetaCart
Preschools and early childhood development in a second best world: Evidence from a scaled-up experiment in

Mining Sequential Patterns

by Rakesh Agrawal, Ramakrishnan Srikant , 1995
"... We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem, and empiri ..."
Abstract - Cited by 1568 (6 self) - Add to MetaCart
, and empirically evaluate their performance using synthetic data. Two of the proposed algorithms, AprioriSome and AprioriAll, have comparable performance, albeit AprioriSome performs a little better when the minimum number of customers that must support a sequential pattern is low. Scale-up experiments show

Fast Algorithms for Mining Association Rules

by Rakesh Agrawal, Ramakrishnan Srikant , 1994
"... We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known a ..."
Abstract - Cited by 3612 (15 self) - Add to MetaCart
algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. We also show how the best features of the two proposed algorithms can be combined into a hybrid algorithm, called AprioriHybrid. Scale-up experiments show that AprioriHybrid scales linearly

Author(s):

by Elizabeth Tipton, Kate Sullivan, Larry Hedges, Michael Vaden-kiernan, Geoffrey Borman, Sarah Caverly
"... Title: Designing a sample selection plan to improve generalizations from two scale-up experiments ..."
Abstract - Add to MetaCart
Title: Designing a sample selection plan to improve generalizations from two scale-up experiments

A Comparison of Methods for Multiclass Support Vector Machines

by Chih-Wei Hsu, Chih-Jen Lin - IEEE TRANS. NEURAL NETWORKS , 2002
"... Support vector machines (SVMs) were originally designed for binary classification. How to effectively extend it for multiclass classification is still an ongoing research issue. Several methods have been proposed where typically we construct a multiclass classifier by combining several binary class ..."
Abstract - Cited by 952 (22 self) - Add to MetaCart
larger optimization problem is required so up to now experiments are limited to small data sets. In this paper we give decomposition implementations for two such “all-together” methods. We then compare their performance with three methods based on binary classifications: “one-against-all,” “one

Capacity of Ad Hoc Wireless Networks

by Jinyang Li, Charles Blake, Douglas S. J. De Couto, Hu Imm Lee, Robert Morris
"... Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examine ..."
Abstract - Cited by 636 (14 self) - Add to MetaCart
simulation results with experiments. We also show that the traffic pattern determines whether an ad hoc network’s per node capacity will scale to large networks. In particular, we show that for total capacity to scale up with network size the average distance between source and destination nodes must remain

Wide-area cooperative storage with CFS

by Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica , 2001
"... The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS does this with a completely decentralized architecture that can scale to large systems. CFS servers pr ..."
Abstract - Cited by 999 (53 self) - Add to MetaCart
The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS does this with a completely decentralized architecture that can scale to large systems. CFS servers

A Scalable Location Service for Geographic Ad Hoc Routing,”

by Jinyang Li , John Jannotti , Douglas S J De Couto , David R Karger , Robert Morris , Jinyang Li , John Jannotti , Alfred P Sloane , Foundation Fellowship , Lucille Packard , Foundations Fellowship , Jinyang 46 , John Li , Jannotti - Proceedings of ACM/IEEE MobiCom , 2000
"... Abstract. GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile node ..."
Abstract - Cited by 769 (17 self) - Add to MetaCart
of node identifiers and a predefined geographic hierarchy. Queries for a mobile node's location also use the predefined identifier ordering and spatial hierarchy to find a location server for that node. Experiments using the ns simulator for up to 600 mobile nodes show that the storage and bandwidth

Using the Nyström Method to Speed Up Kernel Machines

by Christopher Williams, Matthias Seeger - Advances in Neural Information Processing Systems 13 , 2001
"... A major problem for kernel-based predictors (such as Support Vector Machines and Gaussian processes) is that the amount of computation required to find the solution scales as O(n ), where n is the number of training examples. We show that an approximation to the eigendecomposition of the Gram matrix ..."
Abstract - Cited by 434 (6 self) - Add to MetaCart
A major problem for kernel-based predictors (such as Support Vector Machines and Gaussian processes) is that the amount of computation required to find the solution scales as O(n ), where n is the number of training examples. We show that an approximation to the eigendecomposition of the Gram

Intelligent Tutoring Goes to School in the Big City

by Kenneth R. Koedinger, John R. Anderson, William H. Hadley, Mary A. Mark - International Journal of Artificial Intelligence in Education , 1997
"... Abstract. This paper reports on a large-scale experiment introducing and evaluating intelligent tutoring in an urban High School setting. Critical to the success of this project has been a client-centered design approach that has matched our client's expertise in curricular objectives and class ..."
Abstract - Cited by 421 (118 self) - Add to MetaCart
Abstract. This paper reports on a large-scale experiment introducing and evaluating intelligent tutoring in an urban High School setting. Critical to the success of this project has been a client-centered design approach that has matched our client's expertise in curricular objectives
Results 1 - 10 of 5,059