Sciweavers

262 search results - page 29 / 53
» Approximating the 2-Interval Pattern Problem
Sort
View
COMPGEOM
2011
ACM
13 years 1 months ago
Metric graph reconstruction from noisy data
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
Mridul Aanjaneya, Frédéric Chazal, D...
COR
2008
112views more  COR 2008»
13 years 10 months ago
Buffer allocation in general single-server queueing networks
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
Frederico R. B. Cruz, A. R. Duarte, Tom Van Woense...
NIPS
1994
13 years 11 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
14 years 4 months ago
Cross-Mining Binary and Numerical Attributes
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
Gemma C. Garriga, Hannes Heikinheimo, Jouni K. Sep...
COLING
1996
13 years 11 months ago
Learning Dependencies between Case Frame Slots
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
Hang Li, Naoki Abe