4926 search results - page 484 / 986 » Two Graph Algorithms On an Associative Computing Model |
152
Voted
LCPC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
153
Voted
ECML
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
141
Voted
ISMB
1994
15 years 5 months ago
1994
A new version of the GRAIL system (Uberbacher and Mural, 1991; Mural et al., 1992; Uberbacher et al., 1993), called GRAILII, has recently been developed (Xu et al., 1994). GRAILII...
129
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
148
Voted
SYNASC
2006
IEEE
15 years 9 months ago
2006
IEEE
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...