Sciweavers

80 search results - page 5 / 16
» Pattern avoidance and the Bruhat order
Sort
View
WWW
2005
ACM
14 years 7 months ago
Gimme' the context: context-driven automatic semantic annotation with C-PANKOW
Without the proliferation of formal semantic annotations, the Semantic Web is certainly doomed to failure. In earlier work we presented a new paradigm to avoid this: the 'Sel...
Günter Ladwig, Philipp Cimiano, Steffen Staab
PIMRC
2008
IEEE
14 years 1 months ago
Radio-Triggered Wake-ups with Addressing Capabilities for extremely low power sensor network applications
Sensor network applications are generally characterized by long idle durations and intermittent communication patterns. The traffic loads are typically so low that overall idle d...
Junaid Ansari, Dmitry Pankin, Petri Mähö...
IJON
2008
152views more  IJON 2008»
13 years 5 months ago
Topos: Spiking neural networks for temporal pattern recognition in complex real sounds
This article depicts the approach used to build the Topos application, a simulation of two-wheel robots able to discern real complex sounds. Topos is framed in the nouvelle concep...
Pablo González-Nalda, Blanca Cases
ICPR
2000
IEEE
14 years 7 months ago
A Modification of Eigenvalues to Compensate Estimation Errors of Eigenvectors
In statistical pattern recognition, parameters of distributions are usually estimated from training samples. It is well known that shortage of training samples causes estimation e...
Masakazu Iwamura, Shinichiro Omachi, Hirotomo Aso
DDECS
2009
IEEE
128views Hardware» more  DDECS 2009»
14 years 1 months ago
A fast untestability proof for SAT-based ATPG
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...
Daniel Tille, Rolf Drechsler