Sciweavers

2681 search results - page 212 / 537
» Problem F
Sort
View
103
Voted
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 6 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
107
Voted
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 1 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
ICDE
1999
IEEE
97views Database» more  ICDE 1999»
16 years 2 months ago
Systematic Multiresolution and Its Application to the World Wide Web
Many emerging environments are increasingly facing the problem where the requirements of applications easily outstrip the system resources. This is particularly acute in the World...
Swarup Acharya, Henry F. Korth, Viswanath Poosala
108
Voted
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
15 years 9 months ago
Checking equivalence of quantum circuits and states
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes
84
Voted
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
15 years 9 months ago
Length-Matching Routing for High-Speed Printed Circuit Boards
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
Muhammet Mustafa Ozdal, Martin D. F. Wong