10996 search results - page 280 / 2200 » Future Directions in Computing |
159
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
161
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n...
145
click to vote
WG
2007
Springer
16 years 21 days ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
157
click to vote
TMI
2008
15 years 6 months ago
2008
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...
165
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
We present Waterhouse, a system for sending and receiving cryptographically protected electronic mail ("secure e-mail"). We show how an existing e-mail interface can be ...