2446 search results - page 136 / 490 » Choiceless Polynomial Time |
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
IROS
2007
IEEE
15 years 7 months ago
2007
IEEE
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
83
Voted
COLT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
89
Voted
MFCS
2007
Springer
15 years 7 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
CCS
2003
ACM
15 years 6 months ago
2003
ACM
Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down it...