Sciweavers

3154 search results - page 37 / 631
» Computing Closed Skycubes
Sort
View
ICML
2006
IEEE
14 years 9 months ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
LREC
2008
101views Education» more  LREC 2008»
13 years 10 months ago
BLEU+: a Tool for Fine-Grained BLEU Computation
We present a tool, BLEU+, which implements various extension to BLEU computation to allow for a better understanding of the translation performance, especially for morphologically...
A. Cüneyd Tantug, Kemal Oflazer, Ilknur Durga...
LICS
2009
IEEE
14 years 3 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
CORR
1999
Springer
65views Education» more  CORR 1999»
13 years 8 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
PPSN
1998
Springer
14 years 1 months ago
Mechanisms of Emergent Computation in Cellular Automata
Abstract. We introduce a class of embedded-particle models for describing the emergent computational strategies observed in cellular automata (CAs) that were evolved for performing...
Wim Hordijk, James P. Crutchfield, Melanie Mitchel...