93 search results - page 8 / 19 » Hybrid symbolic-explicit techniques for the graph coloring p... |
PVLDB
2010
13 years 5 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
FOSSACS
2006
Springer
13 years 10 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
INFOCOM
2009
IEEE
14 years 1 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
PG
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...