1629 search results - page 209 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
101
click to vote
PVLDB
2008
14 years 9 months ago
2008
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
WWW
2001
ACM
15 years 10 months ago
2001
ACM
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
151
click to vote
BVAI
2007
Springer
15 years 4 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
SOCIALCOM
2010
14 years 7 months ago
2010
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...