8582 search results - page 1458 / 1717 » Here or There |
179
click to vote
WG
1998
Springer
15 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
200
click to vote
POPL
1997
ACM
15 years 10 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
137
click to vote
SIGCOMM
1997
ACM
15 years 10 months ago
1997
ACM
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
176
click to vote
SIGDOC
1997
ACM
15 years 10 months ago
1997
ACM
This paper describes the strengths and weaknesses of two usability assessment methods frequently applied to web sites. It uses case histories of WWW usability studies conducted by...
176
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
This paper describes an algorithm for automatically adapting existing simulated behaviors to new characters. Animating a new character is difficult because a control system tuned...