Sciweavers

3229 search results - page 382 / 646
» The Theory of Timed Automata
Sort
View
193
Voted
IIWAS
2008
15 years 8 months ago
Double-agent architecture for collaborative supply chain formation
Supply chains have evolved to web-applications that tap on the power of internet to expand their networks online. Recently some research attention is focused on make-to-order supp...
Yang Hang, Simon Fong
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 8 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
DLT
2004
15 years 8 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 6 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
ENTCS
2008
138views more  ENTCS 2008»
15 years 6 months ago
Compositionality of Statically Scheduled IP
Timing Closure in presence of long global wire interconnects is one of the main current issues in System-onChip design. One proposed solution to the Timing Closure problem is Late...
Julien Boucaron, Jean-Vivien Millo