Sciweavers

2004 search results - page 48 / 401
» Sampling from large graphs
Sort
View
ACL
2009
14 years 9 months ago
Knowing the Unseen: Estimating Vocabulary Size over Unseen Samples
Empirical studies on corpora involve making measurements of several quantities for the purpose of comparing corpora, creating language models or to make generalizations about spec...
Suma Bhat, Richard Sproat
CORR
2010
Springer
179views Education» more  CORR 2010»
14 years 9 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer
ICASSP
2010
IEEE
14 years 12 months ago
Graph based event detection from realistic videos using weak feature correspondence
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
Lei Ding, Quanfu Fan, Jen-Hao Hsiao, Sharath Panka...
111
Voted
BMCBI
2010
183views more  BMCBI 2010»
14 years 12 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
DAC
2002
ACM
16 years 23 days ago
Efficient code synthesis from extended dataflow graphs for multimedia applications
This paper presents efficient automatic code synthesis techniques from dataflow graphs for multimedia applications. Since multimedia applications require large size buffers contai...
Hyunok Oh, Soonhoi Ha