Sciweavers

1489 search results - page 7 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
IOPADS
1996
87views more  IOPADS 1996»
13 years 8 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
CCIA
2008
Springer
13 years 9 months ago
On the Dimensions of Data Complexity through Synthetic Data Sets
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
Núria Macià, Ester Bernadó-Ma...
ICML
2009
IEEE
14 years 8 months ago
A convex formulation for learning shared structures from multiple tasks
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
Jianhui Chen, Lei Tang, Jun Liu, Jieping Ye
DCC
2007
IEEE
14 years 7 months ago
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
Milena Milenkovic, Aleksandar Milenkovic, Martin B...
CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 7 months ago
Nested Ordered Sets and their Use for Data Modelling
In this paper we present a new approach to data modelling, called the concept-oriented model (CoM), and describe its main features and characteristics including data semantics and ...
Alexandr A. Savinov