Sciweavers

2826 search results - page 189 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
IM
2007
15 years 4 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
BMCBI
2008
114views more  BMCBI 2008»
15 years 4 months ago
Identifying a few foot-and-mouth disease virus signature nucleotide strings for computational genotyping
Background: Serotypes of the Foot-and-Mouth disease viruses (FMDVs) were generally determined by biological experiments. The computational genotyping is not well studied even with...
Guohui Lin, Zhipeng Cai, Junfeng Wu, Xiu-Feng Wan,...
153
Voted
BIOCOMP
2006
15 years 6 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 6 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
CORR
2008
Springer
167views Education» more  CORR 2008»
15 years 4 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud