Sciweavers

3591 search results - page 82 / 719
» Typing linear constraints
Sort
View
IAT
2009
IEEE
15 years 4 months ago
Clustering with Constrained Similarity Learning
—This paper proposes a method of learning a similarity matrix from pairwise constraints for interactive clustering. The similarity matrix can be learned by solving an optimizatio...
Masayuki Okabe, Seiji Yamada
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 10 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
BDA
2006
14 years 11 months ago
Capturing well typed references in DTDs
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...
Nicole Bidoit, Dario Colazzo
VLDB
1991
ACM
179views Database» more  VLDB 1991»
15 years 1 months ago
A Relationship Mechanism for a Strongly Typed Object-Oriented Database Programming Language
Object-oriented data models are receiving wide attention since they provide expressive ionmechanismsto model naturally and directly both structural and behavioral aspectsof comple...
Antonio Albano, Giorgio Ghelli, Renzo Orsini
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 4 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers