Sciweavers

83 search results - page 13 / 17
» Lossless Data Compression Using Optimal Tree Machines
Sort
View
NSDI
2010
13 years 9 months ago
Hedera: Dynamic Flow Scheduling for Data Center Networks
Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands of machines. However, because of limited port densities in even the highest-end swi...
Mohammad Al-Fares, Sivasankar Radhakrishnan, Barat...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 12 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
PAMI
2012
11 years 10 months ago
Task-Driven Dictionary Learning
—Modeling data with linear combinations of a few elements from a learned dictionary has been the focus of much recent research in machine learning, neuroscience, and signal proce...
Julien Mairal, Francis Bach, Jean Ponce
ECTEL
2007
Springer
14 years 1 months ago
Using MotSaRT to Support On-Line Teachers in Student Motivation
Motivation to learn is affected by a student’s self-efficacy, goal orientation, locus of control and perceived task difficulty. In the classroom, teachers know how to motivate th...
Teresa Hurley, Stephan Weibelzahl
ICCV
2009
IEEE
15 years 13 days ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...