Sciweavers

227 search results - page 39 / 46
» How Good Is a Kernel When Used as a Similarity Measure
Sort
View
SBBD
2008
256views Database» more  SBBD 2008»
13 years 8 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
EDBT
2009
ACM
96views Database» more  EDBT 2009»
14 years 2 months ago
Top-k dominant web services under multi-criteria matching
As we move from a Web of data to a Web of services, enhancing the capabilities of the current Web search engines with effective and efficient techniques for Web services retrieva...
Dimitrios Skoutas, Dimitris Sacharidis, Alkis Simi...
BMCBI
2008
111views more  BMCBI 2008»
13 years 7 months ago
Information-based methods for predicting gene function from systematic gene knock-downs
Background: The rapid annotation of genes on a genome-wide scale is now possible for several organisms using high-throughput RNA interference assays to knock down the expression o...
Matthew T. Weirauch, Christopher K. Wong, Alexandr...
BMCBI
2010
243views more  BMCBI 2010»
13 years 7 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
JCSS
2010
91views more  JCSS 2010»
13 years 5 months ago
Content-dependent chunking for differential compression, the local maximum approach
When a file is to be transmitted from a sender to a recipient and when the latter already has a file somewhat similar to it, remote differential compression seeks to determine t...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...