Sciweavers

2853 search results - page 322 / 571
» Finding related tables
Sort
View
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
15 years 6 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 6 months ago
Support Vector Machine Classification with Indefinite Kernels
In this paper, we propose a method for support vector machine classification using indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex loss function, our...
Ronny Luss, Alexandre d'Aspremont
DCG
2010
69views more  DCG 2010»
15 years 6 months ago
Irreducible Apollonian Configurations and Packings
An Apollonian configuration of circles is a collection of circles in the plane with disjoint interiors such that the complement of the interiors of the circles consists of curvili...
Steve Butler, Ronald L. Graham, Gerhard Guettler, ...
EOR
2010
88views more  EOR 2010»
15 years 6 months ago
Market-based pricing in grids: On strategic manipulation and computational cost
Grid technologies and the related concepts of utility computing and cloud computing enable the dynamic sourcing of computer resources and services, thus allowing enterprises to cu...
Jochen Stößer, Dirk Neumann, Christof W...
ECCC
2008
65views more  ECCC 2008»
15 years 6 months ago
A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
Chris Calabro