Sciweavers

16626 search results - page 2970 / 3326
» Computing is a natural science
Sort
View
198
Voted
IPL
2011
96views more  IPL 2011»
15 years 1 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay
228
Voted
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 10 months ago
Probabilistic Logic: Many-valuedness and Intensionality
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
Zoran Majkic
ICASSP
2011
IEEE
14 years 10 months ago
Fast orthogonal decomposition of Volterra cubic kernels using oblique unfolding
Discrete-time Volterra modeling is a central topic in many application areas and a large class of nonlinear systems can be modeled using high-order Volterra series. The problem wi...
Rémy Boyer, Roland Badeau, Gérard Fa...
180
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Powerful extensions to CRFS for grapheme to phoneme conversion
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
Stefan Hahn, Patrick Lehnen, Hermann Ney
232
Voted
IS
2011
14 years 10 months ago
Collection trees for event-monitoring queries
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Antonios Deligiannakis, Yannis Kotidis, Vassilis S...
« Prev « First page 2970 / 3326 Last » Next »