Sciweavers

2826 search results - page 226 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
WSC
1998
15 years 8 months ago
Sequential Allocations that Reduce Risk for Multiple Comparisons
We consider how to efficiently allocate computing resources in order to infer the best of a finite set of simulated systems, where best means that the system has the maximal expec...
Stephen E. Chick, Koichiro Inoue
CIKM
1997
Springer
15 years 10 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu
ESCIENCE
2006
IEEE
16 years 19 days ago
Provisioning and Scheduling Resources for World-Wide Data-Sharing Services
Grid computing is becoming the natural way to aggregate and share large and heterogeneous sets of resources. However, grid development and acceptance hinge on proving that grids r...
Alexandru Iosup, Pawel Garbacki, Dick H. J. Epema
PAM
2005
Springer
16 years 2 days ago
Analysis of Communities of Interest in Data Networks
Abstract. Communities of interest (COI) have been applied in a variety of environments ranging from characterizing the online buying behavior of individuals to detecting fraud in t...
William Aiello, Charles R. Kalmanek, Patrick Drew ...
CVPR
2011
IEEE
15 years 2 months ago
Sparse Image Representation with Epitomes
Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictiona...
Louise Benoit, Julien Mairal, Francis Bach, Jean P...