Sciweavers

160 search results - page 20 / 32
» A spectral approach to bandwidth and separator problems in g...
Sort
View
GD
1995
Springer
13 years 11 months ago
Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
M. Sheelagh T. Carpendale, David J. Cowperthwaite,...
AAAI
2012
11 years 10 months ago
Transfer Learning with Graph Co-Regularization
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
Mingsheng Long, Jianmin Wang 0001, Guiguang Ding, ...
TIT
2010
138views Education» more  TIT 2010»
13 years 2 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
13 years 7 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
CIE
2007
Springer
14 years 1 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond