Sciweavers

3757 search results - page 307 / 752
» The overlap number of a graph
Sort
View
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. ...
ECIR
2008
Springer
15 years 8 months ago
Use of Implicit Graph for Recommending Relevant Videos: A Simulated Evaluation
In this paper, we propose a model for exploiting community based usage information for video retrieval. Implicit usage information from a pool of past users could be a valuable sou...
David Vallet, Frank Hopfgartner, Joemon M. Jose
AAAI
1996
15 years 8 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter