2766 search results - page 474 / 554 » Algorithms for trigonometric polynomials |
148
click to vote
FCT
2009
Springer
15 years 7 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
112
Voted
ASWEC
2004
IEEE
15 years 7 months ago
2004
IEEE
Network protocol implementations are susceptible to problems caused by their lack of ability to handle invalid inputs. We present ASPIRE: Automated Systematic Protocol Implementat...
161
Voted
DILS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...
132
Voted
FGR
2004
IEEE
15 years 7 months ago
2004
IEEE
The null space-based LDA takes full advantage of the null space while the other methods remove the null space. It proves to be optimal in performance. From the theoretical analysi...
149
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...