Sciweavers

6251 search results - page 384 / 1251
» Randomness, Computability, and Density
Sort
View
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
16 years 8 days ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
16 years 1 days ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
183
Voted
BIRTHDAY
2003
Springer
16 years 9 hour ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem
ISMB
1993
15 years 8 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
JCP
2008
126views more  JCP 2008»
15 years 6 months ago
Content-Based Computer Simulation of a Networking Course: An Assessment
This paper presents a successful lab simulation experience to teach signal modulation and demodulation concepts in communication and computer networks to computer science and compu...
Giti Javidi, Ehsan Sheybani