330 search results - page 45 / 66 » Relative survival analysis in R |
WPES
2003
ACM
14 years 1 months ago
2003
ACM
There have long been threads of investigation into covert channels, and threads of investigation into anonymity, but these two closely related areas of information hiding have not...
ADHOCNOW
2003
Springer
14 years 1 months ago
2003
Springer
This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffi...
CIVR
2003
Springer
14 years 1 months ago
2003
Springer
Feature selection for video retrieval applications is impractical with existing techniques, because of their high time complexity and their failure on the relatively sparse trainin...
IMR
2003
Springer
14 years 1 months ago
2003
Springer
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...