Sciweavers

5473 search results - page 723 / 1095
» On the graph isomorphism problem
Sort
View
FOCS
1993
IEEE
15 years 11 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
ICDM
2007
IEEE
151views Data Mining» more  ICDM 2007»
15 years 10 months ago
Combining Collective Classification and Link Prediction
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
Mustafa Bilgic, Galileo Namata, Lise Getoor
DATE
2004
IEEE
122views Hardware» more  DATE 2004»
15 years 10 months ago
Phase Coupled Code Generation for DSPs Using a Genetic Algorithm
The growing use of digital signal processors (DSPs) in embedded systems necessitates the use of optimizing compilers supporting special hardware features. Due to the irregular arc...
Markus Lorenz, Peter Marwedel
FSTTCS
2000
Springer
15 years 10 months ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen
HT
1991
ACM
15 years 10 months ago
Identifying Aggregates in Hypertext Structures
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
Rodrigo A. Botafogo, Ben Shneiderman