1951 search results - page 213 / 391 » An algorithm for improving graph partitions |
159
Voted
WDAG
2000
Springer
15 years 9 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
148
click to vote
ICWSM
2008
15 years 7 months ago
2008
Identifying topics and concepts associated with a set of documents is a task common to many applications. It can help in the annotation and categorization of documents and be used...
129
click to vote
DAC
2003
ACM
16 years 6 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
262
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
ICASSP
2008
IEEE
16 years 6 hour ago
2008
IEEE
—Automated estimation of DNA base-sequences is an important step in genomics and in many other emerging fields in biological and medical sciences. Current automated sequencers p...