1172 search results - page 139 / 235 » Path Algorithms on Regular Graphs |
119
click to vote
ISPA
2007
Springer
15 years 6 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
128
click to vote
POPL
1993
ACM
15 years 4 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
104
Voted
NIPS
2004
15 years 2 months ago
2004
Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by...
89
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...