5100 search results - page 308 / 1020 » The Linear Complexity of a Graph |
184
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
163
click to vote
INFOCOM
2006
IEEE
16 years 24 days ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
220
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discretetime stochastic complex networks with randomly occurr...
186
click to vote
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
15 years 6 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
202
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...