Sciweavers

895 search results - page 82 / 179
» Using graphs for some discrete tomography problems
Sort
View
WSC
1997
14 years 15 days ago
A Simulation-Based Finite Capacity Scheduling System
This paper describes the methodology of a finite capacity scheduling system which uses an objectoriented discrete event simulation as its engine. The scheduling system is develop...
Alexander J. Weintraub, Andrew Zozom Jr., Thom J. ...
ISICA
2007
Springer
14 years 5 months ago
Parameter Setting for Evolutionary Latent Class Clustering
The latent class model or multivariate multinomial mixture is a powerful model for clustering discrete data. This model is expected to be useful to represent non-homogeneous popula...
Damien Tessier, Marc Schoenauer, Christophe Bierna...
MICS
2008
124views more  MICS 2008»
13 years 9 months ago
Community Structures of Networks
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
William Y. C. Chen, Andreas W. M. Dress, Winking Q...
COLT
2004
Springer
14 years 4 months ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
14 years 5 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...