Sciweavers

1469 search results - page 122 / 294
» Approximate polynomial decomposition
Sort
View
FOCS
2006
IEEE
15 years 4 months ago
Inclusion--Exclusion Algorithms for Counting Set Partitions
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
Andreas Björklund, Thore Husfeldt
ARITH
1993
IEEE
15 years 2 months ago
An accurate LNS arithmetic unit using interleaved memory function interpolator
This paper describes a logarithmic number system (LNS) arithmetic unit using a new methodfor polynomial interpolation in hardware. The use of an interleaved memory reduces storage...
David M. Lewis
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 10 months ago
Correlated Equilibria in Continuous Games: Characterization and Computation
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...
PVLDB
2008
111views more  PVLDB 2008»
14 years 9 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
GLOBECOM
2009
IEEE
15 years 1 months ago
Joint Base Station Placement and Fault-Tolerant Routing in Wireless Sensor Networks
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
Dejun Yang, Satyajayant Misra, Guoliang Xue