Sciweavers

2294 search results - page 289 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
218
Voted
DISOPT
2011
240views Education» more  DISOPT 2011»
14 years 9 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
130
Voted
CSB
2005
IEEE
152views Bioinformatics» more  CSB 2005»
15 years 8 months ago
Consensus Genetic Maps: A Graph Theoretic Approach
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
Benjamin G. Jackson, Srinivas Aluru, Patrick S. Sc...
116
Voted
GPEM
2006
82views more  GPEM 2006»
15 years 2 months ago
Shortcomings with using edge encodings to represent graph structures
There are various representations for encoding graph structures, such as artificial neural networks (ANNs) and circuits, each with its own strengths and weaknesses. Here we analyz...
Gregory Hornby
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
15 years 7 months ago
FSM decomposition by direct circuit manipulation applied to low power design
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
José C. Monteiro, Arlindo L. Oliveira
CORR
2007
Springer
107views Education» more  CORR 2007»
15 years 2 months ago
Morphological annotation of Korean with Directly Maintainable Resources
This article describes an exclusively resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. Our annotator is designed to p...
Ivan Berlocher, Hyun-Gue Huh, Eric Laporte, Jee-Su...