628 search results - page 10 / 126 » Magic Counting Methods |
EDBT
1992
ACM
13 years 12 months ago
1992
ACM
GD
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
AAAI
1996
13 years 9 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
ACL
2006
13 years 9 months ago
2006
In this paper, we will present an efficient method to compute the co-occurrence counts of any pair of substring in a parallel corpus, and an algorithm that make use of these count...
VISUALIZATION
1998
IEEE
14 years 4 days ago
1998
IEEE
Visualization of three dimensional flow has to overcome a lot of problems to be effective. Among them are occlusion of distant details, lack of directional and depth hints and clu...