1395 search results - page 248 / 279 » (k, )-Distance-Hereditary Graphs |
DAC
1998
ACM
14 years 9 months ago
1998
ACM
An embedded system the system continuously interacts with its environment under strict timing constraints, called the external constraints, and it is important to know how these e...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
ICCAD
2005
IEEE
14 years 5 months ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...