5592 search results - page 706 / 1119 » On Random Betweenness Constraints |
206
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
220
click to vote
SODA
2010
ACM
16 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
170
click to vote
ICCAD
2007
IEEE
16 years 4 months ago
2007
IEEE
—This work proposes a new yield computation technique dedicated to HLS, which is an essential component in timing variationaware HLS research field. The SSTAs used by the curren...
202
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to...
219
click to vote
WPES
2006
ACM
16 years 1 months ago
2006
ACM
Recent trends in Internet computing have led to the popularization of many forms of virtual organizations. Examples include supply chain management, grid computing, and collaborat...