Sciweavers

1259 search results - page 208 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
MOBISYS
2007
ACM
16 years 5 months ago
Context browsing with mobiles - when less is more
Except for a handful of "mobile" Web sites, the Web is designed for browsing with personal computers with large screens capable of fitting the content of most Web pages....
Yevgen Borodin, Jalal Mahmud, I. V. Ramakrishnan
TDP
2010
166views more  TDP 2010»
15 years 22 days ago
Communication-Efficient Privacy-Preserving Clustering
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 6 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
ICWN
2008
15 years 7 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
COMCOM
2006
147views more  COMCOM 2006»
15 years 6 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das