Sciweavers

103 search results - page 15 / 21
» Representations of graphs modulo n
Sort
View
ICALP
2001
Springer
14 years 1 days ago
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which ...
Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. S...
IJON
2006
103views more  IJON 2006»
13 years 7 months ago
Kernel extrapolation
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...
S. V. N. Vishwanathan, Karsten M. Borgwardt, Omri ...
MMS
2002
13 years 7 months ago
Smart VideoText: a video data model based on conceptual graphs
An intelligent annotation-based video data model called Smart VideoText is introduced. It utilizes the conceptual graph knowledge representation formalism to capture the semantic a...
Fotis Kokkoras, Haitao Jiang, Ioannis P. Vlahavas,...
GD
2008
Springer
13 years 8 months ago
Succinct Greedy Graph Drawing in the Hyperbolic Plane
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
David Eppstein, Michael T. Goodrich
ECAI
2004
Springer
14 years 28 days ago
Towards a Logical Analysis of Biochemical Reactions
We provide a logical model of biochemical reactions and show how hypothesis generation using weakest sufficient and strongest necessary conditions may be used to provide addition...
Patrick Doherty, Steve Kertes, Martin Magnusson, A...