2612 search results - page 316 / 523 » Switching Graphs and Their Complexity |
160
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
143
click to vote
SIGSOFT
2008
ACM
2008
ACM
Experience in using a process language to define scientific workflow and generate dataset provenance
16 years 5 months ago
This paper describes our experiences in exploring the applicability of software engineering approaches to scientific data management problems. Specifically, this paper describes h...
155
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
144
click to vote
ICDCS
2009
IEEE
16 years 2 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
151
click to vote
ICCD
2003
IEEE
16 years 1 months ago
2003
IEEE
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...