Sciweavers

2214 search results - page 58 / 443
» complexity 2004
Sort
View
COMPGEOM
2004
ACM
14 years 1 months ago
On lines avoiding unit balls in three dimensions
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, M...
MFCS
2004
Springer
14 years 1 months ago
Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
Rolf Niedermeier
DCC
2004
IEEE
13 years 11 months ago
Model Based Optimal Bit Allocation
Modeling of the operational rate-distortion characteristics of a signal can significantly reduce the computational complexity of an optimal bit allocation algorithm. In this repor...
Nasir Rajpoot
MASCOTS
2004
13 years 9 months ago
Large-Scale Simulation Models of BGP
The complex nature of the Border Gateway Protocol (BGP) is not amenable to analytical modeling, and thus simulation
Xenofontas A. Dimitropoulos, George F. Riley
ECAI
2004
Springer
14 years 1 months ago
Automatic Induction of Domain-Related Information: Learning Descriptors Type Domains
Abstract. Learning in complex contexts often requires pure induction to be supported by various kinds of meta-information. Providing such information is a critical, difficult and ...
Stefano Ferilli, Floriana Esposito, Teresa Maria A...