Sciweavers

9 search results - page 2 / 2
» Finding Good Configurations in High-Dimensional Spaces: Doin...
Sort
View
BIOINFORMATICS
2006
92views more  BIOINFORMATICS 2006»
13 years 7 months ago
What should be expected from feature selection in small-sample settings
Motivation: High-throughput technologies for rapid measurement of vast numbers of biological variables offer the potential for highly discriminatory diagnosis and prognosis; howev...
Chao Sima, Edward R. Dougherty
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
IWCIA
2009
Springer
14 years 2 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
HPCA
1998
IEEE
13 years 11 months ago
Address Translation Mechanisms In Network Interfaces
Good network hardware performance is often squandered by overheads for accessing the network interface (NI) within a host. NIs that support user-level messaging avoid frequent ope...
Ioannis Schoinas, Mark D. Hill