Sciweavers

3972 search results - page 626 / 795
» Cosparse analysis modeling - uniqueness and algorithms
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
MOBIHOC
2005
ACM
16 years 3 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
CCS
2009
ACM
15 years 10 months ago
As-awareness in Tor path selection
Tor is an anonymous communications network with thousands of router nodes worldwide. An intuition reflected in much of the literature on anonymous communications is that, as an a...
Matthew Edman, Paul F. Syverson
CIKM
2007
Springer
15 years 10 months ago
Opinion retrieval from blogs
Opinion retrieval is a document retrieval process, which requires documents to be retrieved and ranked according to their opinions about a query topic. A relevant document must sa...
Wei Zhang, Clement T. Yu, Weiyi Meng
180
Voted
IPSN
2007
Springer
15 years 10 months ago
Tracking multiple targets using binary proximity sensors
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar 0003...