4913 search results - page 918 / 983 » Results and Perspectives of the G |
152
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
168
click to vote
ACMDIS
2004
ACM
15 years 11 months ago
2004
ACM
We elaborate a proposal for capturing, extending, and reusing design knowledge gleaned through usability testing. The proposal is specifically targeted to address interface design...
194
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
147
click to vote
IMC
2004
ACM
15 years 11 months ago
2004
ACM
The Internet is teeming with high variability phenomena, from measured IP flow sizes to aspects of inferred router-level connectivity, but there still exists considerable debate ...
182
click to vote
ISPD
2004
ACM
15 years 11 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...