Sciweavers

9359 search results - page 470 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 7 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
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 11 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
SAC
2010
ACM
16 years 1 months ago
On processing location based top-k queries in the wireless broadcasting system
In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial sp...
HaRim Jung, Byung Ku Cho, Yon Dohn Chung, Ling Liu
GIS
2008
ACM
16 years 7 months ago
Continuous proximity monitoring in road networks
In this paper, we consider the following scenario: a set of mobile objects continuously track their positions in a road network and are able to communicate with a central server. ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
DAC
2009
ACM
16 years 7 months ago
O-Router:an optical routing framework for low power on-chip silicon nano-photonic integration
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...
Duo Ding, Yilin Zhang, Haiyu Huang, Ray T. Chen, D...