393 search results - page 32 / 79 » The LCA Problem Revisited |
PAM
2005
Springer
15 years 7 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...
110
click to vote
LICS
2003
IEEE
15 years 7 months 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...
114
click to vote
COMPGEOM
2010
ACM
15 years 7 months 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...
130
click to vote
COMPGEOM
1997
ACM
15 years 6 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
104
click to vote
ICSE
1994
IEEE-ACM
15 years 6 months ago
1994
IEEE-ACM
act Research issues related to requirements modeling are introduced and discussed through a review of the requirements modeling language RML, its peers and its successors from the ...