7811 search results - page 337 / 1563 » computer 2004 |
169
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
174
click to vote
COCO
2004
Springer
16 years 20 hour ago
2004
Springer
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
141
click to vote
JSSPP
2004
Springer
15 years 12 months ago
2004
Springer
The well-known TOP500 list ranks the 500 most powerful high-performance computers. However, the list lacks details about the job management and scheduling on these machines. As thi...
178
click to vote
ECOOPW
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This report gives an overview of the sixth Workshop on Formal Techniques for Java-like Programs at ECOOP 2004. It explains the motivation for the a workshop and summarise...
149
click to vote
CODES
2004
IEEE
15 years 10 months ago
2004
IEEE
The recent proliferation of computing technology has brought added interest to natural I/O interface technologies such as speech recognition. Unfortunately, the computational and ...