Sciweavers

740 search results - page 64 / 148
» Lower bounds for Buchsbaum* complexes
Sort
View
IJCNN
2000
IEEE
15 years 4 months ago
VC Dimension Bounds for Product Unit Networks
A product unit is a formal neuron that multiplies its input values instead of summingthem. Furthermore, it has weights acting as exponents instead of being factors. We investigate...
Michael Schmitt
MASCOTS
2007
15 years 1 months ago
Stochastic Bounds Applied to the End to End QoS in Communication Systems
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
Hind Castel, Lynda Mokdad, Nihal Pekergin
STACS
2009
Springer
15 years 6 months ago
Quantum Query Complexity of Multilinear Identity Testing
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
Vikraman Arvind, Partha Mukhopadhyay
IWPEC
2009
Springer
15 years 6 months ago
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
Panos Giannopoulos, Christian Knauer, Günter ...
ILP
2003
Springer
15 years 5 months ago
Complexity Parameters for First-Order Classes
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
Marta Arias, Roni Khardon