2485 search results - page 71 / 497 » Time Bounded Frequency Computations |
154
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
117
click to vote
SOFSEM
1997
Springer
15 years 8 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
139
click to vote
MIR
2004
ACM
15 years 10 months ago
2004
ACM
Searching moving object trajectories of video databases has been applied to many fields, such as video data analysis, content-based video retrieval, video scene classification. ...
128
click to vote
SPAA
1992
ACM
15 years 8 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
174
click to vote
DFG
1992
Springer
15 years 8 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...