Sciweavers

892 search results - page 87 / 179
» An efficient terminal and model order reduction algorithm
Sort
View
EDBT
2009
ACM
165views Database» more  EDBT 2009»
13 years 8 months ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos
COGSR
2011
102views more  COGSR 2011»
13 years 5 months ago
Rethinking cognitive architecture via graphical models
Cognitive architectures need to resolve the diversity dilemma – i.e., to blend diversity and simplicity – in order to couple functionality and efficiency with integrability, e...
Paul S. Rosenbloom
NIPS
2000
13 years 11 months ago
Sparse Representation for Gaussian Process Models
We develop an approach for a sparse representation for Gaussian Process (GP) models in order to overcome the limitations of GPs caused by large data sets. The method is based on a...
Lehel Csató, Manfred Opper
ACL
2010
13 years 8 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
TCAD
2008
116views more  TCAD 2008»
13 years 10 months ago
Scalable Synthesis and Clustering Techniques Using Decision Diagrams
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...
Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown