Sciweavers

384 search results - page 48 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
JOLLI
2007
88views more  JOLLI 2007»
13 years 7 months ago
Toward discourse representation via pregroup grammars
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...
Anne Preller
ISPDC
2010
IEEE
13 years 6 months ago
Pretty Good Accuracy in Matrix Multiplication with GPUs
—With systems such as Road Runner, there is a trend in super computing to offload parallel tasks to special purpose co-processors, composed of many relatively simple scalar proc...
Matthew Badin, Lubomir Bic, Michael B. Dillencourt...
ICALP
2007
Springer
14 years 1 months ago
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
ICIC
2007
Springer
14 years 1 months ago
Rough Set Theory of Shape Perception
Humans can easily recognize complex objects even if values of their attributes are imprecise and often inconsistent. It is not clear how the brain processes uncertain visual inform...
Andrzej W. Przybyszewski
CVPR
2012
IEEE
11 years 10 months ago
Large-scale knowledge transfer for object localization in ImageNet
ImageNet is a large-scale database of object classes with millions of images. Unfortunately only a small fraction of them is manually annotated with bounding-boxes. This prevents ...
Matthieu Guillaumin, Vittorio Ferrari