Sciweavers

1169 search results - page 131 / 234
» Degrees of monotone complexity
Sort
View
118
Voted
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
14 years 10 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
118
Voted
OTM
2010
Springer
14 years 10 months ago
Composing Near-Optimal Expert Teams: A Trade-Off between Skills and Connectivity
Abstract. Rapidly changing business requirements necessitate the adhoc composition of expert teams to handle complex business cases. Expertcentric properties such as skills, howeve...
Christoph Dorn, Schahram Dustdar
84
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Design of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity
This paper proposes a class of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity. To improve the analyticity of complex wavelet, a different allpass ï...
Xi Zhang
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 10 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
SPAA
2009
ACM
15 years 7 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn