Sciweavers

2370 search results - page 17 / 474
» A Structured Set of Higher-Order Problems
Sort
View
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
14 years 1 months ago
A Set Theory Based Approach on Applying Domain Semantics to XML Structures
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
Wolfgang Schuetzelhofer, Karl M. Göschka
APPML
2002
58views more  APPML 2002»
13 years 8 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 8 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
SLS
2007
Springer
120views Algorithms» more  SLS 2007»
14 years 2 months ago
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to ...
Benoît Laurent, Jin-Kao Hao
JMLR
2012
11 years 11 months ago
On Sparse, Spectral and Other Parameterizations of Binary Probabilistic Models
This paper studies issues relating to the parameterization of probability distributions over binary data sets. Several such parameterizations of models for binary data are known, ...
David Buchman, Mark W. Schmidt, Shakir Mohamed, Da...