Sciweavers

2104 search results - page 295 / 421
» Sorting with networks of data structures
Sort
View
SERVICES
2008
103views more  SERVICES 2008»
15 years 6 months ago
Grouping Distributed Stream Query Services by Operator Similarity and Network Locality
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
Sangeetha Seshadri, Bhuvan Bamba, Brian F. Cooper,...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 10 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
CORR
2012
Springer
281views Education» more  CORR 2012»
14 years 19 days ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
DSN
2007
IEEE
15 years 11 months ago
Using Register Lifetime Predictions to Protect Register Files against Soft Errors
— Device scaling and large integration increase the vulnerability of microprocessors to transient errors. One of the structures where errors can be most harmful is the register ï...
Pablo Montesinos, Wei Liu, Josep Torrellas
SDM
2010
SIAM
182views Data Mining» more  SDM 2010»
15 years 6 months ago
HCDF: A Hybrid Community Discovery Framework
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...
Keith Henderson, Tina Eliassi-Rad, Spiros Papadimi...