Sciweavers

1887 search results - page 103 / 378
» Clustering with Local Restrictions
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
15 years 10 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
MOBIHOC
2008
ACM
15 years 9 months ago
Localized distance-sensitive service discovery in wireless sensor networks
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...
Xu Li, Nicola Santoro, Ivan Stojmenovic
CONTEXT
2001
Springer
15 years 2 months ago
Local Holism
Abstract. This paper is devoted to discuss a general tendency in contextualism which is known as "radical contextualism". In the first part I state the well known paradox...
Carlo Penco
ECCC
2006
120views more  ECCC 2006»
14 years 10 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
ESWA
2007
100views more  ESWA 2007»
14 years 9 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih