3055 search results - page 203 / 611 » Randomized Search Trees |
105
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
109
Voted
WIOPT
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
141
Voted
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
134
Voted
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we propose an integrated error resilient MDC scheme for wireless networks with both packet loss and random bit errors. Two descriptions are first generated independ...
97
Voted
GLVLSI
2003
IEEE
15 years 6 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...