1081 search results - page 44 / 217 » Working with the LR Degrees |
95
Voted
JGT
2007
15 years 19 days ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
144
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
94
Voted
ICSE
2001
IEEE-ACM
15 years 5 months ago
2001
IEEE-ACM
Global software development is rapidly becoming the norm for technology companies. Previous qualitative research suggests that multi-site development may increase development cycl...
144
click to vote
PODC
2012
ACM
13 years 3 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
ICIP
1994
IEEE
16 years 2 months ago
1994
IEEE
Gabor filters have been applied successfully to the segmentation of textured images. Previous investigators have used banks of Gabor filters, where the filter parameters were pred...