Sciweavers

19320 search results - page 425 / 3864
» On the complexity of computing determinants
Sort
View
VLSID
1994
IEEE
84views VLSI» more  VLSID 1994»
15 years 11 months ago
Energy Efficient Programmable Computation
: This paper describes techniques for energy efficient implementation of programmable computation. consumption in programmable computation can be substantiallvlowered with nolossin...
Anantha Chandrakasan, Mani B. Srivastava, Robert W...
FCS
2006
15 years 8 months ago
Algorithmic Control in Concurrent Computations
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
Mark Burgin
ISCAICIS
2000
15 years 8 months ago
Computer Vision Framework for Analyzing Projections from Video of Lectures
The overhead and computer projectors have become an essential element to the classroom and corporate settings. Users of web-based classes and conferences would like to have access...
Michael N. Wallick, Niels da Vitoria Lobo, Mubarak...
MOC
2002
103views more  MOC 2002»
15 years 6 months ago
A computational approach to Hilbert modular group fixed points
Some useful information is known about the fundamental domain for certain Hilbert modular groups. The six nonequivalent points with nontrivial isotropy in the fundamental domains u...
Jesse Ira Deutsch
RC
2007
83views more  RC 2007»
15 years 6 months ago
Computing the Pessimism of Inclusion Functions
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
Gilles Chabert, Luc Jaulin