4744 search results - page 200 / 949 » Connected Computing |
157
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
134
Voted
CISST
2003
15 years 4 months ago
2003
We present a new method to compress triangle meshes in a lossless manner. Triangle compression requires compression of the geometry (vertices) as well as the topology (connectivit...
125
Voted
GRAPHICSINTERFACE
2000
15 years 4 months ago
2000
In this paper we introduce a simple and efficient scheme for encodingthe connectivityand the stripification of a triangle mesh. Since generating a good set of triangle strips is a...
120
Voted
EUROSIM
1994
15 years 4 months ago
1994
: The Perfect benchmarks are a collection of scientific and engineering application-level programs that have been widely used to compare the performance of many different computer ...
119
click to vote
ISQED
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we address the interconnect-driven floorplanning problem that integrates OPC-friendly bus assignment with floorplanning. Buses consist of a number of horizontal/v...