Sciweavers

867 search results - page 74 / 174
» On Two Forms of Structural Recursion
Sort
View
91
Voted
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
15 years 7 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
IPPS
2007
IEEE
15 years 7 months ago
Spinneret: A Log Random Substrate for P2P Networks
Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstr...
Jeff Rose, Cyrus P. Hall, Antonio Carzaniga
106
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 27 days 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
82
Voted
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
15 years 7 months ago
Continuous motion planning for information forecast
— This paper addresses planning of continuous paths for mobile sensors to improve long-term forecast performance. With the information gain defined by the mutual information bet...
Han-Lim Choi, Jonathan P. How
81
Voted
AUTOMATICA
2010
99views more  AUTOMATICA 2010»
15 years 22 days ago
Continuous trajectory planning of mobile sensors for informative forecasting
This paper addresses planning of continuous paths for mobile sensors to reduce uncertainty in some quantities of interest in the future. The mutual information between the measure...
Han-Lim Choi, Jonathan P. How