Sciweavers

8094 search results - page 5 / 1619
» Improvements in Formula Generalization
Sort
View
111
Voted
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
15 years 10 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich
ALGORITHMICA
2010
88views more  ALGORITHMICA 2010»
15 years 3 months ago
Improved Bounds for Wireless Localization
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...
119
Voted
AIML
1998
15 years 4 months ago
Canonical Pseudo-Correspondence
Generalizing an example from (Fine 1975) and inspired by a theorem in (J
Yde Venema
COMBINATORICS
2004
96views more  COMBINATORICS 2004»
15 years 3 months ago
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weigh...
Nicholas A. Loehr, Jeffrey B. Remmel
TSP
2010
14 years 10 months ago
On entropy rate for the complex domain and its application to i.i.d. sampling
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
Wei Xiong, Hualiang Li, Tülay Adali, Yi-Ou Li...