Sciweavers

1573 search results - page 159 / 315
» A Data Structure for Sponsored Search
Sort
View
WWW
2009
ACM
15 years 9 months ago
Extracting data records from the web using tag path clustering
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
Gengxin Miao, Jun'ichi Tatemura, Wang-Pin Hsiung, ...
BMCBI
2011
14 years 8 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
NIPS
2004
15 years 5 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
IJFCS
2006
83views more  IJFCS 2006»
15 years 4 months ago
A Simple Alphabet-independent Fm-index
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...
Szymon Grabowski, Gonzalo Navarro, Rafal Przywarsk...
UAI
1996
15 years 5 months ago
Bayesian Learning of Loglinear Models for Neural Connectivity
This paper presents a Bayesian approach to learning the connectivity structure of a group of neurons from data on configuration frequencies. A major objective of the research is t...
Kathryn B. Laskey, Laura Martignon