Sciweavers

3443 search results - page 2 / 689
» More Algebras for Determiners
Sort
View
ANTS
2004
Springer
95views Algorithms» more  ANTS 2004»
13 years 10 months ago
Using Primitive Subgroups to Do More with Fewer Bits
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of...
Karl Rubin, Alice Silverberg
APAL
2000
84views more  APAL 2000»
13 years 6 months ago
More on Cardinal Invariants of Boolean Algebras
We address several questions of Donald Monk related to irredundance and spread of Boolean algebras, gaining both some ZFC knowledge and consistency results. We show in ZFC that ir...
Andrzej Roslanowski, Saharon Shelah
NIPS
2004
13 years 8 months ago
Real-Time Pitch Determination of One or More Voices by Nonnegative Matrix Factorization
An auditory "scene", composed of overlapping acoustic sources, can be viewed as a complex object whose constituent parts are the individual sources. Pitch is known to be...
Fei Sha, Lawrence K. Saul
SIGMOD
2006
ACM
112views Database» more  SIGMOD 2006»
14 years 7 months ago
Join minimization in XML-to-SQL translation: an algebraic approach
Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our t...
Murali Mani, Song Wang, Daniel J. Dougherty, Elke ...
ENTCS
2006
129views more  ENTCS 2006»
13 years 7 months ago
Confluence Thanks to Extensional Determinism
A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several p...
A. W. Roscoe