Sciweavers

4305 search results - page 325 / 861
» The Test of Time
Sort
View
201
Voted
SSDBM
2002
IEEE
128views Database» more  SSDBM 2002»
15 years 11 months ago
Compressing Bitmap Indexes for Faster Search Operations
In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, N...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
ICSE
2001
IEEE-ACM
15 years 11 months ago
Fast Formal Analysis of Requirements via "Topoi Diagrams"
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
Tim Menzies, John D. Powell, Michael E. Houle
UIST
2000
ACM
15 years 11 months ago
Suede: a Wizard of Oz prototyping tool for speech user interfaces
Speech-based user interfaces are growing in popularity. Unfortunately, the technology expertise required to build speech UIs precludes many individuals from participating in the s...
Scott R. Klemmer, Anoop K. Sinha, Jack Chen, James...
MICCAI
1999
Springer
15 years 11 months ago
Performance of Robotic Augmentation in Microsurgery-Scale Motions
This paper is part of the development process of a microsurgical "cooperating" assistant. To evaluate its applicability to augment fine surgical motions, we test precisio...
Rajesh Kumar 0001, Tushar M. Goradia, Aaron C. Bar...
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 11 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan