1242 search results - page 89 / 249 » A Computational Complexity Theory in Membrane Computing |
MM
2005
ACM
15 years 3 months ago
2005
ACM
“diorama table “ is an interactive table installation. People place physical objects on the table and projected elements such as trains, cars, houses, and trees appear and are...
CIE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
DIS
2003
Springer
15 years 3 months ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
108
click to vote
PODS
2012
ACM
13 years 15 days ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...