Sciweavers

3268 search results - page 588 / 654
» The hub number of a graph
Sort
View
IJFCS
1998
67views more  IJFCS 1998»
14 years 11 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
JCISE
2002
117views more  JCISE 2002»
14 years 11 months ago
Memory Analysis of Solid Model Representations for Heterogeneous Objects
Methods to represent and exchange parts consisting of Functionally Graded Material (FGM) for Solid Freeform Fabrication (SFF) with Local Composition Control (LCC) are evaluated ba...
Todd R. Jackson, Wonjoon Cho, Nicholas M. Patrikal...
KI
2002
Springer
14 years 11 months ago
Representation of Behavioral Knowledge for Planning and Plan-Recognition in a Cognitive Vision System
The algorithmic generation of textual descriptions of image sequences requires conceptual knowledge. In our case, a stationary camera recorded image sequences of road traffic scene...
Michael Arens, Hans-Hellmut Nagel
MST
2002
169views more  MST 2002»
14 years 11 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
14 years 11 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow