Sciweavers

934 search results - page 147 / 187
» A theoretical analysis of the HIFF problem
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 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
JSAC
2008
151views more  JSAC 2008»
14 years 9 months ago
Joint Beamforming and Power Allocation for Multiple Access Channels in Cognitive Radio Networks
A cognitive radio (CR) network is often described as a secondary network operating in a frequency band originally licensed/allocated to a primary network consisting of one or multi...
Lan Zhang, Ying-Chang Liang, Yan Xin
GI
2003
Springer
15 years 3 months ago
Strategic Simulation Games to foster Policy Development for Critical Infrastructure Protection
: Strategic Simulation Games have become an important element of policy development in the context of Critical Infrastructure Protection (CIP). They foster the network between all ...
Matthias Holenstein, Daniel Bircher
DIS
2001
Springer
15 years 2 months ago
Functional Trees
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...
Joao Gama
ACMSE
2006
ACM
14 years 11 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray