680 search results - page 89 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
ICCV
2005
IEEE
14 years 10 months ago
2005
IEEE
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
SMC
2007
IEEE
14 years 2 months ago
2007
IEEE
— An important consideration in clustering is the determination of the correct number of clusters and the appropriate partitioning of a given data set. In this paper, a newly dev...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
In the Ad-Hoc InfoWare project, we develop a delay tolerant event notification service for sparse Mobile Ad-Hoc Networks for emergency and rescue operations. In most event notific...