147 search results - page 22 / 30 » The Computational Complexity of Quantified Reciprocals |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
VLSID
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper quantifies the performance of typical functional unit interface designs in single-chip systems. We introduce a specific equation to guide the design of optimal module i...
101
click to vote
PERCOM
2007
ACM
15 years 9 months ago
2007
ACM
Middleware support for pervasive context-aware systems relieves context-aware applications from dealing with the complexity of context-specific operations such as context acquisit...
P2P
2007
IEEE
15 years 3 months ago
2007
IEEE
An important security issue in DHT-based structured overlay networks is to provide anonymity to the storage nodes. Compromised routing tables in those DHTs leak information about ...
63
Voted
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— Due to the abundant application background, the optimization of maintenance problem has been extensively studied in the past decades. Besides the well-known difficulty of larg...