Sciweavers

5046 search results - page 839 / 1010
» Feature Selection from Huge Feature Sets
Sort
View
PAMI
2012
13 years 9 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
BIOINFORMATICS
2012
13 years 9 months ago
MolClass: a web portal to interrogate diverse small molecule screen datasets with different computational models
Summary: The MolClass toolkit and data portal generates computational models from user-defined small molecule datasets based on structural features identified in hit and non-hit m...
Jan Wildenhain, Nicholas FitzGerald, Mike Tyers
MLG
2007
Springer
16 years 19 days ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
INFOCOM
2000
IEEE
15 years 11 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong
IOPADS
1996
87views more  IOPADS 1996»
15 years 7 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