Sciweavers

656 search results - page 47 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
DCC
2007
IEEE
14 years 7 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
COMMA
2008
13 years 9 months ago
Focused search for Arguments from Propositional Knowledge
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
Vasiliki Efstathiou, Anthony Hunter
WG
2005
Springer
14 years 1 months ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
Pinar Heggernes, Daniel Lokshtanov
DIS
2009
Springer
14 years 2 months ago
An Iterative Learning Algorithm for Within-Network Regression in the Transductive Setting
Within-network regression addresses the task of regression in partially labeled networked data where labels are sparse and continuous. Data for inference consist of entities associ...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
WG
1993
Springer
13 years 11 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...