Sciweavers

1640 search results - page 61 / 328
» Conditional Independence Trees
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
14 years 24 days ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ISMVL
1997
IEEE
82views Hardware» more  ISMVL 1997»
15 years 9 months ago
Finding Composition Trees for Multiple-Valued Functions
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
Elena Dubrova, Jon C. Muzio, Bernhard von Stengel
ISSRE
2007
IEEE
15 years 6 months ago
Using Machine Learning to Support Debugging with Tarantula
Using a specific machine learning technique, this paper proposes a way to identify suspicious statements during debugging. The technique is based on principles similar to Tarantul...
Lionel C. Briand, Yvan Labiche, Xuetao Liu
152
Voted
INFOCOM
2003
IEEE
15 years 10 months ago
Design and Analysis of an MST-Based Topology Control Algorithm
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...
Ning Li, Jennifer C. Hou, Lui Sha
127
Voted
INFOCOM
1994
IEEE
15 years 9 months ago
Any Work-Conserving Policy Stabilizes the Ring with Spatial Reuse
We consider the ring network with spatial reuse. Tra c streams may enter and exit the network at any node. We adopt an arrival tra c model with deterministic constraints on its sa...
Leandros Tassiulas, Leonidas Georgiadis