Sciweavers

154 search results - page 6 / 31
» Using Galois Ideals for Computing Relative Resolvents
Sort
View
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 2 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
DEBS
2008
ACM
13 years 9 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
CHES
2005
Springer
85views Cryptology» more  CHES 2005»
14 years 28 days ago
Secure Data Management in Trusted Computing
Abstract. In this paper we identify shortcomings of the TCG specification related to the availability of sealed data during software and hardware life cycles, i.e., software updat...
Ulrich Kühn, Klaus Kursawe, Stefan Lucks, Ahm...
ACL
2009
13 years 5 months ago
Using Syntax to Disambiguate Explicit Discourse Connectives in Text
Discourse connectives are words or phrases such as once, since, and on the contrary that explicitly signal the presence of a discourse relation. There are two types of ambiguity t...
Emily Pitler, Ani Nenkova
BMCBI
2005
152views more  BMCBI 2005»
13 years 7 months ago
GeneKeyDB: A lightweight, gene-centric, relational database to support data mining environments
Background: The analysis of biological data is greatly enhanced by existing or emerging databases. Most existing databases, with few exceptions are not designed to easily support ...
S. A. Kirov, X. Peng, E. Baker, D. Schmoyer, B. Zh...