1951 search results - page 190 / 391 » An algorithm for improving graph partitions |
148
click to vote
VRML
1998
ACM
15 years 10 months ago
1998
ACM
We present a new method for (1) automatically generating multiple Levels Of Detail (LODs) of a polygonal surface, (2) progressively loading, or transmitting, and displaying a surf...
142
click to vote
HICSS
2008
IEEE
16 years 15 days ago
2008
IEEE
Containing much valuable information, networks such as the World Wide Web, social networks and metabolic networks draw increasingly attention in scientific communities. Network cl...
170
click to vote
FUN
2007
Springer
15 years 10 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
147
click to vote
TSP
2008
15 years 6 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
173
click to vote
CIKM
2009
Springer
16 years 19 days ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...