2391 search results - page 396 / 479 » The Complexity of Connectivity in Wireless Networks |
158
click to vote
MSS
2000
IEEE
15 years 10 months ago
2000
IEEE
Disk subsystems span the range of configuration complexity from single disk drives to large installations of disk arrays. They can be directly attached to individual computer syst...
150
click to vote
ICAI
2003
15 years 7 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
131
click to vote
MOR
2010
15 years 4 months ago
2010
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
232
click to vote
IPL
2010
15 years 24 days ago
2010
Balanced Feistel networks (BFN) have been widely used for constructing efficient block ciphers. They are known to provide high efficiency with respect to differential and linear c...
169
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...