Sciweavers

4074 search results - page 669 / 815
» Defining Computational Aesthetics
Sort
View
MP
2006
88views more  MP 2006»
15 years 3 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
MP
2006
119views more  MP 2006»
15 years 3 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
PR
2006
108views more  PR 2006»
15 years 3 months ago
Boosted discriminant projections for nearest neighbor classification
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
David Masip, Jordi Vitrià
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 3 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
116
Voted
IJCINI
2007
112views more  IJCINI 2007»
15 years 3 months ago
Neo-Symbiosis: The Next Stage in the Evolution of Human Information Interaction
The purpose of this paper is to re-address the vision of human-computer symbiosis as originally expressed by J.C.R. Licklider nearly a half-century ago and to argue for the releva...
Douglas Griffith, Frank L. Greitzer