Sciweavers

678 search results - page 40 / 136
» Structural Properties of Sparse Graphs
Sort
View
BC
2004
86views more  BC 2004»
13 years 8 months ago
Is sparse and distributed the coding goal of simple cells?
Abstract. The question of why the receptive fields of simple cells in the primary visual cortex are Gabor-like is a crucial one in vision research. Many research efforts (Olshausen...
Li Zhao
WWW
2007
ACM
14 years 9 months ago
Random web crawls
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
Toufik Bennouas, Fabien de Montgolfier
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
14 years 3 months ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
14 years 3 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
CORR
2002
Springer
156views Education» more  CORR 2002»
13 years 8 months ago
Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design
Despite recent excitement generated by the peer-to-peer (P2P) paradigm and the surprisingly rapid deployment of some P2P applications, there are few quantitative evaluations of P2...
Matei Ripeanu, Ian T. Foster, Adriana Iamnitchi