953 search results - page 16 / 191 » Efficient Evaluation of Large Polynomials |
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
AAAI
2006
13 years 9 months ago
2006
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...