Sciweavers

7868 search results - page 1505 / 1574
» Learning by Answer Sets
Sort
View
FAST
2010
15 years 7 months ago
Discovery of Application Workloads from Network File Traces
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level he...
Neeraja J. Yadwadkar, Chiranjib Bhattacharyya, K. ...
OSDI
2008
ACM
15 years 7 months ago
DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language
DryadLINQ is a system and a set of language extensions that enable a new programming model for large scale distributed computing. It generalizes previous execution environments su...
Yuan Yu, Michael Isard, Dennis Fetterly, Mihai Bud...
KDD
2010
ACM
242views Data Mining» more  KDD 2010»
15 years 7 months ago
A scalable two-stage approach for a class of dimensionality reduction techniques
Dimensionality reduction plays an important role in many data mining applications involving high-dimensional data. Many existing dimensionality reduction techniques can be formula...
Liang Sun, Betul Ceran, Jieping Ye
MCS
2010
Springer
15 years 7 months ago
Dynamic Selection of Ensembles of Classifiers Using Contextual Information
In a multiple classifier system, dynamic selection (DS) has been used successfully to choose only the best subset of classifiers to recognize the test samples. Dos Santos et al...
Paulo Rodrigo Cavalin, Robert Sabourin, Ching Y. S...
ACL
2008
15 years 7 months ago
The Tradeoffs Between Open and Traditional Relation Extraction
Traditional Information Extraction (IE) takes a relation name and hand-tagged examples of that relation as input. Open IE is a relationindependent extraction paradigm that is tail...
Michele Banko, Oren Etzioni
« Prev « First page 1505 / 1574 Last » Next »