379 search results - page 19 / 76 » The Graham-Knowlton Problem Revisited |
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
PAM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The development of veracious models of the Internet topology has received a lot of attention in the last few years. Many proposed models are based on topologies derived f...
LICS
2003
IEEE
14 years 26 days ago
2003
IEEE
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
COMPGEOM
2010
ACM
14 years 20 days ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
We give a fresh look into score normalization for merging result-lists, isolating the problem from other components. We focus on three of the simplest, practical, and widelyused l...