Sciweavers

7978 search results - page 1383 / 1596
» Representation before computation
Sort
View
CALCO
2007
Springer
95views Mathematics» more  CALCO 2007»
16 years 23 days ago
Higher Dimensional Trees, Algebraically
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...
Neil Ghani, Alexander Kurz
CCS
2007
ACM
16 years 23 days ago
Topological analysis of network attack vulnerability
: To understand overall vulnerability to network attack, one must consider attacker exploits not just in isolation, but also in combination. That is, one must analyze how low-level...
Sushil Jajodia
CIVR
2007
Springer
361views Image Analysis» more  CIVR 2007»
16 years 23 days ago
Interpretability based interest points detection
This paper deals with a new interest points detector. Unlike most standard detectors which concentrate on the local shape of the signal, the main objective of this new operator is...
Ahmed Rebai, Alexis Joly, Nozha Boujemaa
COST
2007
Springer
118views Multimedia» more  COST 2007»
16 years 23 days ago
The Organization of a Neurocomputational Control Model for Articulatory Speech Synthesis
The organization of a computational control model of articulatory speech synthesis is outlined in this paper. The model is based on general principles of neurophysiology and cognit...
Bernd J. Kröger, Anja Lowit, Ralph Schnitker
CPAIOR
2007
Springer
16 years 23 days ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus
« Prev « First page 1383 / 1596 Last » Next »