Sciweavers

4171 search results - page 290 / 835
» Choice numbers of graphs
Sort
View
LOPSTR
2004
Springer
16 years 4 days ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
120
Voted
HAIS
2010
Springer
15 years 11 months ago
Graph-Based Model-Selection Framework for Large Ensembles
The intuition behind ensembles is that different prediciton models compensate each other’s errors if one combines them in an appropriate way. In case of large ensembles a lot of...
Krisztian Buza, Alexandros Nanopoulos, Lars Schmid...
ICCAD
2000
IEEE
149views Hardware» more  ICCAD 2000»
15 years 11 months ago
Dynamic Response Time Optimization for SDF Graphs
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...
Dirk Ziegenbein, Jan Uerpmann, Ralph Ernst
INFOCOM
1997
IEEE
15 years 11 months ago
Secret Sharing in Graph-Based Prohibited Structures
A secret sharing schemefor the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsetsof ...
Hung-Min Sun, Shiuh-Pyng Shieh
IPPS
1997
IEEE
15 years 11 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...