Sciweavers

4201 search results - page 223 / 841
» Interaction graphs: Additives
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 4 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
CICLING
2010
Springer
16 years 1 months ago
An Experimental Study on Unsupervised Graph-based Word Sense Disambiguation
Recent research works on unsupervised word sense disambiguation report an increase in performance, which reduces their handicap from the respective supervised approaches for the sa...
George Tsatsaronis, Iraklis Varlamis, Kjetil N&osl...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 12 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
IEEECIT
2010
IEEE
15 years 5 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
GLOBECOM
2006
IEEE
16 years 20 days ago
When Does One Redundant Parity-Check Equation Matter?
— We analyze the effect of redundant parity-check equations on the error-floor performance of low-density paritycheck (LDPC) codes used over the additive white Gaussian noise (A...
Stefan Laendner, Thorsten Hehn, Olgica Milenkovic,...