4343 search results - page 433 / 869 » Improving Visual Matching |
119
click to vote
ICCE
2007
15 years 6 months ago
2007
: For communicable writing, reviewing and revising is essential. In this paper, we propose an SNS-based environment to improve writing by repeated collaborative reviewing. The resu...
137
click to vote
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
139
click to vote
CC
2006
Springer
15 years 4 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
141
Voted
PRL
1998
15 years 4 months ago
1998
This paper describes and evaluates an image-based place recognition method for mobile robots based on matching image signatures. The method represents an image as a set of arrays ...
126
click to vote
PR
2002
15 years 4 months ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...