Sciweavers

809 search results - page 143 / 162
» Similarity, topology, and uniformity
Sort
View
108
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 22 days ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
103
Voted
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
15 years 9 months ago
Almost Optimal Bounds for Direct Product Threshold Theorem
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
Charanjit S. Jutla
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
15 years 7 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
124
Voted
CCS
2009
ACM
15 years 7 months ago
NISAN: network information service for anonymization networks
Network information distribution is a fundamental service for any anonymization network. Even though anonymization and information distribution about the network are two orthogona...
Andriy Panchenko, Stefan Richter, Arne Rache
INFOCOM
2007
IEEE
15 years 6 months ago
Protecting Receiver-Location Privacy in Wireless Sensor Networks
—Due to the open nature of a sensor network, it is relatively easy for an adversary to eavesdrop and trace packet movement in the network in order to capture the receiver physica...
Ying Jian, Shigang Chen, Zhan Zhang, Liang Zhang