Sciweavers

2125 search results - page 278 / 425
» On Graph Complexity
Sort
View
78
Voted
ENTCS
2010
133views more  ENTCS 2010»
14 years 10 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
76
Voted
CORR
2006
Springer
105views Education» more  CORR 2006»
14 years 10 months ago
A Combinatorial Family of Near Regular LDPC Codes
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandr...
60
Voted
IJON
2006
87views more  IJON 2006»
14 years 10 months ago
Translation-invariant classification of non-stationary signals
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
64
Voted
JEI
2006
109views more  JEI 2006»
14 years 10 months ago
Robotic three-dimensional imaging system for under-vehicle inspection
We present our research efforts toward the deployment of 3-D sensing technology to an under-vehicle inspection robot. The 3-D sensing modality provides flexibility with ambient lig...
Sreenivas R. Sukumar, David L. Page, Andrei V. Gri...
83
Voted
TKDE
2008
121views more  TKDE 2008»
14 years 10 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton