Sciweavers

2286 search results - page 348 / 458
» Algorithms for Categorical Equivalence
Sort
View
EDBT
2004
ACM
121views Database» more  EDBT 2004»
16 years 6 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
TPHOL
2009
IEEE
16 years 1 months ago
A Better x86 Memory Model: x86-TSO
Abstract. Real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory mode...
Scott Owens, Susmit Sarkar, Peter Sewell
MICRO
2008
IEEE
72views Hardware» more  MICRO 2008»
16 years 27 days ago
Low-power, high-performance analog neural branch prediction
Shrinking transistor sizes and a trend toward low-power processors have caused increased leakage, high per-device variation and a larger number of hard and soft errors. Maintainin...
Renée St. Amant, Daniel A. Jiménez, ...
QEST
2008
IEEE
16 years 27 days ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
16 years 20 days ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet