Sciweavers

1541 search results - page 290 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 23 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
BCS
2008
13 years 9 months ago
Fast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
Arnab Sinha, Sumana Gupta
BMCBI
2008
145views more  BMCBI 2008»
13 years 8 months ago
The contrasting properties of conservation and correlated phylogeny in protein functional residue prediction
Background: Amino acids responsible for structure, core function or specificity may be inferred from multiple protein sequence alignments where a limited set of residue types are ...
Jonathan R. Manning, Emily R. Jefferson, Geoffrey ...
OOPSLA
2010
Springer
13 years 6 months ago
Scalable and systematic detection of buggy inconsistencies in source code
Software developers often duplicate source code to replicate functionality. This practice can hinder the maintenance of a software project: bugs may arise when two identical code ...
Mark Gabel, Junfeng Yang, Yuan Yu, Moisés G...
EDBT
2006
ACM
190views Database» more  EDBT 2006»
14 years 8 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...