Sciweavers

579 search results - page 24 / 116
» Intersecting Classes and Prototypes
Sort
View
99
Voted
CORR
1999
Springer
65views Education» more  CORR 1999»
15 years 2 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
123
Voted
DCG
2002
106views more  DCG 2002»
15 years 2 months ago
Perpendicular Dissections of Space
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
Thomas Zaslavsky
134
Voted
ICDAR
2011
IEEE
14 years 2 months ago
Symbol Recognition by Multiresolution Shape Context Matching
—We present a multiresolution scheme for symbol representation and recognition based on statistical shape features. We define a symbol as a set of shape points, each of which is...
Feng Su, Tong Lu, Ruoyu Yang
86
Voted
LATA
2009
Springer
15 years 9 months ago
On Extended Regular Expressions
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
Benjamin Carle, Paliath Narendran
108
Voted
RTA
2010
Springer
15 years 4 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater