2128 search results - page 106 / 426 » A general characterization of indulgence |
210
click to vote
ECCC
2011
14 years 11 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
128
Voted
SIGCOMM
2009
ACM
15 years 11 months ago
2009
ACM
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
142
Voted
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...
133
click to vote
DSN
2007
IEEE
15 years 11 months ago
2007
IEEE
While the new generation of hand-held devices, e.g., smart phones, support a rich set of applications, growing complexity of the hardware and runtime environment makes the devices...
137
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...