6110 search results - page 819 / 1222 » Approximate Computing |
174
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
187
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
169
click to vote
QEST
2008
IEEE
16 years 1 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
208
click to vote
WCNC
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
195
click to vote
ICC
2007
IEEE
16 years 29 days ago
2007
IEEE
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...