Sciweavers

2487 search results - page 227 / 498
» Partitions of Graphs into Trees
Sort
View
ICASSP
2009
IEEE
16 years 1 months ago
Energy-efficient graph-based wavelets for distributed coding in Wireless Sensor Networks
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...
Godwin Shen, Sundeep Pattem, Antonio Ortega
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
15 years 10 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
EACL
1993
ACL Anthology
15 years 8 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 8 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
16 years 1 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu