2512 search results - page 241 / 503 » Learning from Highly Structured Data by Decomposition |
152
click to vote
ACMICEC
2006
ACM
15 years 8 months ago
2006
ACM
In this paper, we look at a supply chain of commodity goods where customer demand is uncertain and partly based on reputation, and where raw material replenishment is uncertain in...
151
click to vote
CMOT
2004
15 years 4 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
150
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
127
click to vote
EJIS
2010
15 years 4 months ago
2010
In the last few decades, several studies have found the same technology implemented in highly similar organizational settings to be associated with very different consequences for...
159
click to vote
BMCBI
2008
2008
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
15 years 4 months ago
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...