5473 search results - page 206 / 1095 » On the graph isomorphism problem |
225
click to vote
ICDT
2010
ACM
16 years 1 days ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
187
click to vote
GECCO
2004
Springer
16 years 17 days ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
206
click to vote
PREMI
2005
Springer
16 years 20 days ago
2005
Springer
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
185
click to vote
JOIN
2007
15 years 7 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
179
click to vote
ISAAC
2005
Springer
16 years 21 days ago
2005
Springer
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...