Sciweavers

4171 search results - page 381 / 835
» Choice numbers of graphs
Sort
View
PAAPP
2000
118views more  PAAPP 2000»
15 years 6 months ago
Processor-time-optimal systolic arrays
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
Peter R. Cappello, Ömer Egecioglu, Chris J. S...
IPPS
2010
IEEE
15 years 4 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
FCS
2009
15 years 4 months ago
Circuits as a Classifier for Small-World Network Models
The number and length distribution of circuits or loops in a graph or network give important insights into its key characteristics. We discuss the circuit properties of various sm...
Arno Leist, Kenneth A. Hawick
CORR
2011
Springer
184views Education» more  CORR 2011»
15 years 2 months ago
Acyclic and Star Colorings of Cographs
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
Andrew Lyons
VLDB
2007
ACM
89views Database» more  VLDB 2007»
16 years 7 months ago
Effective Phrase Prediction
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
Arnab Nandi, H. V. Jagadish