Sciweavers

5634 search results - page 254 / 1127
» About Abstract Classes
Sort
View
LATIN
2010
Springer
15 years 8 months ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
15 years 8 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
APLAS
2008
ACM
15 years 6 months ago
Extensional Universal Types for Call-by-Value
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
Kazuyuki Asada
133
Voted
BIOID
2008
152views Biometrics» more  BIOID 2008»
15 years 6 months ago
On Quality of Quality Measures for Classification
Abstract. In this paper we provide a theoretical discussion of the impact of uncertainty in quality measurement on the expected benefits of including biometric signal quality measu...
Krzysztof Kryszczuk, Andrzej Drygajlo
121
Voted
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
15 years 6 months ago
Using polynomial semi-separable kernels to construct infinite-dimensional Lyapunov functions
Abstract-- In this paper, we introduce the class of semiseparable kernel functions for use in constructing Lyapunov functions for distributed-parameter systems such as delaydiffere...
Matthew M. Peet, Antonis Papachristodoulou