6320 search results - page 845 / 1264 » Towards Situated Computing |
176
click to vote
COMPGEOM
1997
ACM
15 years 11 months ago
1997
ACM
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
151
click to vote
DCC
1996
IEEE
15 years 11 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
184
click to vote
CHI
1994
ACM
15 years 11 months ago
1994
ACM
A marking menu is designed to allow a user to perform a menu selection by either popping-up a radial (or pie) menu, or by making a straight mark in the direction of the desired me...
161
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
194
click to vote
IEEESCC
2010
IEEE
15 years 10 months ago
2010
IEEE
—As the amount of data generated by today’s pervasive environments increases exponentially, there is a stronger need to decipher the important information that is hidden among ...