Sciweavers

7952 search results - page 1538 / 1591
» Methods for Measuring Usability
Sort
View
VLDB
1998
ACM
91views Database» more  VLDB 1998»
14 years 2 months ago
Determining Text Databases to Search in the Internet
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
Weiyi Meng, King-Lup Liu, Clement T. Yu, Xiaodong ...
VISUALIZATION
1997
IEEE
14 years 2 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
VLSID
1996
IEEE
110views VLSI» more  VLSID 1996»
14 years 2 months ago
On test coverage of path delay faults
W epropose a coverage metric and a two-pass test generation method for path delay faults in combinational logic circuits. The coverage is measured for each line with a rising and ...
Ananta K. Majhi, James Jacob, Lalit M. Patnaik, Vi...
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
14 years 2 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
ARITH
1993
IEEE
14 years 2 months ago
Fast implementations of RSA cryptography
We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd divisio...
Mark Shand, Jean Vuillemin
« Prev « First page 1538 / 1591 Last » Next »