Sciweavers

14165 search results - page 526 / 2833
» The generalized two-server problem
Sort
View
CEC
2007
IEEE
16 years 1 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
NSPW
2006
ACM
16 years 29 days ago
Sanitization models and their limitations
This work explores issues of computational disclosure control. We examine assumptions in the foundations of traditional problem statements and abstract models. We offer a comprehe...
Rick Crawford, Matt Bishop, Bhume Bhumiratana, Lis...
FOCS
2005
IEEE
16 years 19 days ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
15 years 11 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi
IWANN
1999
Springer
15 years 11 months ago
Support Vector Machines for Multi-class Classification
Abstract: Support vector machines (SVMs) are primarily designed for 2-class classification problems. Although in several papers it is mentioned that the combination of K SVMs can b...
Eddy Mayoraz, Ethem Alpaydin