Browsing by Subject "Trees (mathematics)"
Now showing items 116 of 16

Article
Automated implementation of complex distributed algorithms specified in the IOA language
(2009)IOA is a formal language for describing Input/Output automata that serves both as a formal specification language and as a programming language (Garland et al. in http://theory.lcs.mit.edu/tds/ioa/manual.ps, 2004). The IOA ...

Conference Object
Bounds on maxproduct algorithms for multiple fault diagnosis in graphs with loops
(Institute of Electrical and Electronics Engineers Inc., 2007)In this paper, we analyze the performance of algorithms that use belief propagation maxproduct iterations to solve the generalized multiple fault diagnosis (GMFD) problem. The GMFD problem is described by a bipartite ...

Conference Object
Convergence of belief propagation algorithms on binary pairwise Gibbs random fields
(2011)In this paper, we study the convergence of belief propagation algorithms (BPAs) on binary pairwise Gibbs random fields (BPGRFs). Exploiting the equivalence of BPA on the graph associated with BPGRF and the corresponding ...

Article
Distributed Calculation of EdgeDisjoint Spanning Trees for Robustifying Distributed Algorithms against ManintheMiddle Attacks
(2017)In this paper we provide a distributed methodology to allow a network of agents, tasked to execute a distributed algorithm, to overcome Maninthemiddle attacks that aim at steering the result of the algorithm towards ...

Article
Efficient bufferless packet switching on trees and leveled networks
(2007)In bufferless networks the packets cannot be buffered while they are in transit

Article
A graphtheoretic network security game
(2008)Consider a network vulnerable to viral infection, where the security software can guarantee safety only to a limited part of it. We model this practical network scenario as a noncooperative multiplayer game on a graph, ...

Article
Initial experiences porting a bioinformatics application to a graphics processor
(2005)Bioinformatics applications are one of the most relevant and computedemanding applications today. While normally these applications are executed on clusters or dedicated parallel systems, in this work we explore the use ...

Conference Object
Marginal analysis on binary pairwise Gibbs random fields
(2011)In this paper, we study marginal problems for a class of binary pairwise Gibbs random fields (BPWGRFs). Given a BPWGRF associated with a family of binary positive pairwise potentials, finding the exact marginal for each ...

Conference Object
The micropulse framework for adaptive waking windows in sensor networks
(2007)In this paper we present MicroPulse, a novel framework for adapting the waking window of a sensing device S based on the data workload incurred by a query Q. Assuming a typical treebased aggregation scenario, the waking ...

Conference Object
Minimumhotspot query trees for wireless sensor networks
(2010)We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a nearoptimally balanced communication tree with minimum ...

Conference Object
Multiobjective query optimization in smartphone social networks
(2011)The bulk of social network applications for smart phones (e.g., Twitter, Face book, Foursquare, etc.) currently rely on centralized or cloudlike architectures in order to carry out their data sharing and searching tasks. ...

Article
On the complexity of parallelizing sequential circuits using the parallelprefix method
(2001)The parallelprefix method uses a tree of identical processing nodes to calculate in parallel, the state and output response of a finitestate machine (FSM) to a finitelength input sequence. Traditionally, each computing ...

Article
Optimized query routing trees for wireless sensor networks
(2011)In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be ...

Conference Object
Performance analysis of sumproduct algorithms for multiple fault diagnosis applications
(2010)In this paper, we study the application of sumproduct algorithms (SPAs) to multiple fault diagnosis (MFD) problems in order to diagnose the most likely state of each component given the status of alarms. SPAs are heuristic ...

Conference Object
Shadow volume BSP trees for computation of shadows in dynamic scenes
(ACM, 1995)This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modification of Shadow Volume Binary Space Partition trees, to allow these be ...

Conference Object
View volume culling using a probabilistic caching scheme
(ACM, 1997)This paper a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the view volume. Frametoframe coherence implies that the ...