Sciweavers

301 search results - page 24 / 61
» Narrowing Directed by a Graph of Terms
Sort
View
ICSE
1995
IEEE-ACM
13 years 11 months ago
A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
Craig Chambers, Jeffrey Dean, David Grove
ARSCOM
1998
104views more  ARSCOM 1998»
13 years 7 months ago
A Note on the Road-Coloring Conjecture
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
E. Gocka, Walter W. Kirchherr, Edward F. Schmeiche...
ICPR
2008
IEEE
14 years 2 months ago
Gene function prediction using protein domain probability and hierarchical Gene Ontology information
The Gene Ontology (GO) is a controlled vocabulary of terms to describe protein functions. It also includes a hierarchical description of the relationships among the terms in the f...
Jaehee Jung, Michael R. Thon
PODC
2006
ACM
14 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
WWW
2008
ACM
14 years 8 months ago
Web video topic discovery and tracking via bipartite graph reinforcement model
Automatic topic discovery and tracking on web-shared videos can greatly benefit both web service providers and end users. Most of current solutions of topic detection and tracking...
Lu Liu, Lifeng Sun, Yong Rui, Yao Shi, Shiqiang Ya...