Sciweavers

1477 search results - page 75 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
IPPS
1997
IEEE
15 years 5 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 3 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
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 5 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
TACAS
2004
Springer
127views Algorithms» more  TACAS 2004»
15 years 6 months ago
MetaGame: An Animation Tool for Model-Checking Games
Abstract. Failing model checking runs should be accompanied by appropriate error diagnosis information that allows the user to identify the cause of the problem. For branching time...
Markus Müller-Olm, Haiseung Yoo
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
15 years 5 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman