Sciweavers

19320 search results - page 18 / 3864
» On the complexity of computing determinants
Sort
View
FOCS
2000
IEEE
14 years 2 months ago
Computing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
Wayne Eberly, Mark Giesbrecht, Gilles Villard
DFT
1999
IEEE
80views VLSI» more  DFT 1999»
14 years 2 months ago
Determination of Yield Bounds Prior to Routing
Integrated Circuit manufacturing complexities have resulted in decreasing product yields and reliabilities. This process has been accelerated with the advent of very deep sub-micr...
Arunshankar Venkataraman, Israel Koren
MM
2000
ACM
98views Multimedia» more  MM 2000»
14 years 2 months ago
Determining computable scenes in films and their structures using audio-visual memory models
In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results f...
Hari Sundaram, Shih-Fu Chang
CHI
2003
ACM
14 years 10 months ago
Who wants to know what when? privacy preference determinants in ubiquitous computing
We conducted a questionnaire-based study of the relative importance of two factors, inquirer and situation, in determining the preferred accuracy of personal information disclosed...
Scott Lederer, Jennifer Mankoff, Anind K. Dey
COMPGEOM
2000
ACM
14 years 2 months ago
Pitfalls in computing with pseudorandom determinants
It has been known for 30 years that pseudorandom number generators in the class of linear congruential generators (LCG) exhibit strong and predictable regularities. A widely used ...
Bernd Gärtner