Sciweavers

1512 search results - page 71 / 303
» connection 2006
Sort
View
JGAA
2006
108views more  JGAA 2006»
14 years 9 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello
COMBINATORICS
2006
89views more  COMBINATORICS 2006»
14 years 9 months ago
Rainbow H-factors
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
Raphael Yuster
IJFCS
2006
132views more  IJFCS 2006»
14 years 9 months ago
Generalized Lr Parsing Algorithm for Boolean Grammars
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
Alexander Okhotin
IJON
2006
138views more  IJON 2006»
14 years 9 months ago
Time-series prediction using a local linear wavelet neural network
A local linear wavelet neural network (LLWNN) is presented in this paper. The difference of the network with conventional wavelet neural network (WNN) is that the connection weigh...
Yuehui Chen, Bo Yang, Jiwen Dong
75
Voted
IJON
2006
52views more  IJON 2006»
14 years 9 months ago
Speed estimation with propagation maps
We propose a neural architecture that estimates the speed of motion. The basis is a two-dimensional map made of locally connected integrate-and-fire neurons, that propagates and i...
C. Rasche