2137 search results - page 290 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
153
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information net...
144
click to vote
ACSD
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
159
Voted
ISMIR
2005
Springer
15 years 10 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
129
click to vote
WCRE
1999
IEEE
15 years 9 months ago
1999
IEEE
The software clustering problem has attracted much attention recently, since it is an integral part of the process of reverse engineering large software systems. A key problem in ...
172
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...