Concept

Parameterized approximation algorithm

Related publications (50)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

This work is concerned with the computational complexity of the recognition of

ÞPtwo

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of

ÞPtwo

of particular interest are also studi ...

IDIAP1998

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

This work is concerned with the computational complexity of the recognition of

ÞPtwo

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of

ÞPtwo

of particular interest are also studi ...

1999

Parameterized approximation algorithm

Graph Chatbot

Chat with Graph Search

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

Evaluation of Input Parameterization for Batch Process Optimization

Semi-Automated Design of a MOS Current Mode Logic Standard Cell Library from Generic Components

Validation of a Solution Model for the Optimization of a Binary Batch Distillation Column

Spectro-Temporal Activity Pattern (STAP) Features for Noise Robust ASR

Spectro-Temporal Activity Pattern (STAP) Features for Noise Robust ASR

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

Optimal Parameterization of Point Distribution Models

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

Spectro-Temporal Activity Pattern (STAP) Features for Noise Robust ASR

Optimal Parameterization of Point Distribution Models

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Semi-Automated Design of a MOS Current Mode Logic Standard Cell Library from Generic Components

Evaluation of Input Parameterization for Batch Process Optimization

Validation of a Solution Model for the Optimization of a Binary Batch Distillation Column

Spectro-Temporal Activity Pattern (STAP) Features for Noise Robust ASR