Sciweavers

318 search results - page 48 / 64
» Real Number Computability and Domain Theory
Sort
View
NIPS
2008
13 years 10 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
AAAI
2006
13 years 10 months ago
SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition
Composing existing Web services to deliver new functionality is a difficult problem as it involves resolving semantic, syntactic and structural differences among the interfaces of...
Rama Akkiraju, Biplav Srivastava, Anca-Andreea Iva...
MST
2010
140views more  MST 2010»
13 years 7 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
GECCO
2010
Springer
129views Optimization» more  GECCO 2010»
14 years 1 months ago
A probabilistic functional crossover operator for genetic programming
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
Josh C. Bongard
SIGMOD
2008
ACM
189views Database» more  SIGMOD 2008»
14 years 9 months ago
Dynamic anonymization: accurate statistical analysis with privacy preservation
A statistical database (StatDB) retrieves only aggregate results, as opposed to individual tuples. This paper investigates the construction of a privacy preserving StatDB that can...
Xiaokui Xiao, Yufei Tao