Sciweavers

8294 search results - page 405 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
JMLR
2010
104views more  JMLR 2010»
15 years 1 months ago
Increasing Feature Selection Accuracy for L1 Regularized Linear Models
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
Abhishek Jaiantilal, Gregory Z. Grudic
IPPS
2009
IEEE
16 years 1 months ago
Using hardware transactional memory for data race detection
Abstract—Widespread emergence of multicore processors will spur development of parallel applications, exposing programmers to degrees of hardware concurrency hitherto unavailable...
Shantanu Gupta, Florin Sultan, Srihari Cadambi, Fr...
VTC
2006
IEEE
129views Communications» more  VTC 2006»
16 years 24 days ago
A Framework for Automatic Clustering of Parametric MIMO Channel Data Including Path Powers
— We present a solution to the problem of identifying clusters from MIMO measurement data in a data window, with a minimum of user interaction. Conventionally, visual inspection ...
Nicolai Czink, Pierluigi Cera, Jari Salo, Ernst Bo...
IJKDB
2010
170views more  IJKDB 2010»
15 years 4 months ago
Clustering Genes Using Heterogeneous Data Sources
Clustering of gene expression data is a standard exploratory technique used to identify closely related genes. Many other sources of data are also likely to be of great assistance...
Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasim...
VLDB
2005
ACM
104views Database» more  VLDB 2005»
16 years 8 days ago
Approximate Matching of Hierarchical Data Using pq-Grams
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
Nikolaus Augsten, Michael H. Böhlen, Johann G...