Sciweavers

921 search results - page 97 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
WG
1998
Springer
14 years 5 days ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
FSS
2008
124views more  FSS 2008»
13 years 8 months ago
Exact calculations of extended logical operations on fuzzy truth values
In this paper we propose computationally simple, pointwise formulas for extended t-norms and t-conorms on fuzzy truth values. The complex convolutions of the extended operations a...
Zsolt Gera, József Dombi
CVPR
2008
IEEE
14 years 10 months ago
Global pose estimation using non-tree models
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
Hao Jiang, David R. Martin
CIE
2010
Springer
13 years 8 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
FOCS
2000
IEEE
14 years 11 days ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk