Sciweavers

7259 search results - page 130 / 1452
» From Fields to Trees
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk
IJCAI
2001
13 years 9 months ago
Temporal Decision Trees or the lazy ECU vindicated
The automatic generation of diagnostic decision trees from qualitative models is a reasonable compromise between the advantages of using a modelbased approach in technical domains...
Luca Console, Claudia Picardi, Daniele Theseider D...
GD
2008
Springer
13 years 9 months ago
Tree Drawings on the Hexagonal Grid
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of dir...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
CISS
2007
IEEE
14 years 2 months ago
High-Throughput Cooperative Communications with Complex Field Network Coding
Relay-based cooperative communications can achieve spatial diversity gains, enhance coverage and potentially increase capacity. If considered for large networks, traditional relayi...
Tairan Wang, Georgios B. Giannakis
TIP
2008
126views more  TIP 2008»
13 years 8 months ago
Maximum-Entropy Expectation-Maximization Algorithm for Image Reconstruction and Sensor Field Estimation
Abstract--In this paper, we propose a maximum-entropy expectation-maximization (MEEM) algorithm. We use the proposed algorithm for density estimation. The maximum-entropy constrain...
Hunsop Hong, Dan Schonfeld