157 search results - page 21 / 32 » Randomized Algorithms for Minimum Distance Localization |
IDA
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
ISPA
2005
Springer
14 years 1 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...