702 search results - page 23 / 141 » Identifying Graph Automorphisms Using Determining Sets |
DAGM
2006
Springer
14 years 5 days ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
SIROCCO
2008
13 years 10 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
BMCBI
2008
13 years 8 months ago
2008
Background: Recently, microarray data analyses using functional pathway information, e.g., gene set enrichment analysis (GSEA) and significance analysis of function and expression...
ACL
2004
13 years 10 months ago
2004
Sentiment analysis seeks to identify the viewpoint(s) underlying a text span; an example application is classifying a movie review as "thumbs up" or "thumbs down&qu...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...