Results 1 - 10 of 359

Acquiring Constraint Networks using a SAT-based Version Space Algorithm

by Christian Bessiere Remi, Christian Bessiere, Remi Coletta, Frédéric Koriche - In ECML , 2005
"... Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. We propose a basis for addressing this problem: a new SAT-based version space algorithm f ..."
Abstract - Add to MetaCart
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. We propose a basis for addressing this problem: a new SAT-based version space algorithm

A SAT-based version space algorithm for acquiring constraint satisfaction problems

by Christian Bessiere, Remi Coletta, Frédéric Koriche - In Proceedings of ECML’05 , 2005
"... Abstract. Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problem appropriately. The lack of availability of such expertise is a signific ..."
Abstract - Cited by 21 (8 self) - Add to MetaCart
significant bottleneck to the broader uptake of constraint technology in the real world. We present a new SATbased version space algorithm for acquiring constraint satisfaction problems from examples of solutions and non-solutions of the target problem. We show how domain-specific knowledge related

Materials for an exploratory theory of the network society.

by Manuel Castells , Anthony Giddens , Alain Touraine , Anthony Smith , Benjamin Barber , Peter Hall , Roger-Pol Droit , Sophie Watson , Frank Webster , Krishan Kumar , David Lyon , Craig Calhoun , Jeffrey Henderson , Ramon Ramos , Jose E Rodrigues-Ibanez , Jose F Tezanos , Mary Kaldor , Stephen Jones , Christopher Freeman - The British Journal of Sociology , 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
as the project is nished. Major corporations work in a strategy of changing alliances and partnerships, speci c to a given product, process, time, and space. Furthermore, these co-operations are based increasingly on sharing of information. These are information networks, which, in the limit, link up suppliers

The Continuous Zoom: A Constrained Fisheye Technique for Viewing and Navigating Large Information Spaces

by Lyn Bartram, Albert Ho, John Dill, Frank Henigman , 1995
"... Navigating and viewing large information spaces, such as hierarchically-organized networks from complex realtime systems, suffer the problems of viewing a large space on a small screen. Distorted-view approaches, such as fisheye techniques, have great potential to reduce these problems by representi ..."
Abstract - Cited by 96 (2 self) - Add to MetaCart
, based on scale factors, followed by degree-of-interest adjustments. Previous versions of the algorithm relied solely on relative scale factors to assign size; we present a new version which allocates space more efficiently using a dynamically calculated degree of interest. In addition to the automatic

1Space-Time Physical-Layer Network Coding

by Namyoon Lee, Robert W. Heath
"... Abstract—A space-time physical-layer network coding (ST-PNC) method is presented for information exchange among multiple users over fully-connected multi-way relay networks. The method involves two key steps: i) side-information learning and ii) space-time relay transmission. In the first phase of s ..."
Abstract - Add to MetaCart
Abstract—A space-time physical-layer network coding (ST-PNC) method is presented for information exchange among multiple users over fully-connected multi-way relay networks. The method involves two key steps: i) side-information learning and ii) space-time relay transmission. In the first phase

To cite this version:

by W Van Ackooij, W Van Ackooij , 2015
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract - Add to MetaCart
-dual decomposition approach to tackle large-scale instances of these two-stage problems. The algorithm makes extensive use of warm-started bundle algorithms, and requires no specific knowledge of the underlying technical constraints. We provide an analysis of the theoretical properties of the algorithm, as well

Constraint Acquisition∗

by Christian Bessiere, Frédéric Koriche, Nadjib Lazaar
"... Constraint programming is used to model and solve complex combina-torial problems. The modeling task requires some expertise in constraint programming. This requirement is a bottleneck to the broader uptake of constraint technology. Several approaches have been proposed to assist the non-expert user ..."
Abstract - Add to MetaCart
representation of the learner’s version space into a clausal formula. Based on this logical representation, our architecture uses strategies for eliciting constraint networks in both the passive acquisition context, where the learner is only provided a pool of examples, and the active acquisition context, where

To cite this version:

by Patrice Abry, Richard Baraniuk, Patrick Fl, Rudolf Riedi, Darryl Veitch, Patrice Abry, Richard Baraniuk, Patrick Fl, Rudolf Riedi, Darryl Veitch Wavelet, Patrice Abry, Richard Baraniuk, Patrick Fl, Rudolf Riedi, Darryl Veitch , 2007
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract - Add to MetaCart
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte

To cite this version:

by Rodolphe Jenatton, Francis Bach, Martin Kleinsteuber, Matthias Seibert, Rodolphe Jenatton, Francis Bach, Martin Kleinsteuber, Matthias Seibert, Hal Id Hal, Rodolphe Jenatton, Francis Bach, Martin Kleinsteuber, Matthias Seibert , 2014
"... de dictionnaire pour les représentations parcimonieuses ..."
Abstract - Add to MetaCart
de dictionnaire pour les représentations parcimonieuses

Multiclass Least Squares Support Vector Machines

by J.A.K. Suykens, J. Vandewalle - In Proceedings of the International Joint Conference on Neural Networks (IJCNN’99 , 1999
"... In this paper we present an extension of least squares support vector machines (LS-SVM's) to the multiclass case. While standard SVM solutions involve solving quadratic or linear programming problems, the least squares version of SVM's corresponds to solving a set of linear equations, due ..."
Abstract - Cited by 83 (11 self) - Add to MetaCart
In this paper we present an extension of least squares support vector machines (LS-SVM's) to the multiclass case. While standard SVM solutions involve solving quadratic or linear programming problems, the least squares version of SVM's corresponds to solving a set of linear equations, due
Results 1 - 10 of 359