4934 search results - page 172 / 987 » complexity 2008 |
117
click to vote
EMNLP
2008
15 years 6 months ago
2008
Regular expressions have served as the dominant workhorse of practical information extraction for several years. However, there has been little work on reducing the manual effort ...
137
click to vote
TOPNOC
2008
15 years 4 months ago
2008
Recursive Petri Nets (RPNs) allow to design and analyze complex discrete event systems. Indeed, RPNs enable to model patterns of discrete event systems related to the dynamic struc...
141
click to vote
JSC
2010
15 years 3 months ago
2010
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
136
click to vote
CDES
2008
15 years 6 months ago
2008
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary multi-outp...
124
click to vote
ENTCS
2008
15 years 4 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...