7971 search results - page 184 / 1595 » On unbounded operators and applications |
162
click to vote
RELMICS
2009
Springer
16 years 1 months ago
2009
Springer
Using relation algebra, we generalize Aumann’s notion of a contact relation and that of a closure operation from powersets to general membership relations and their induced parti...
155
click to vote
ICS
2005
Tsinghua U.
15 years 12 months ago
2005
Tsinghua U.
As parallel jobs get bigger in size and finer in granularity, “system noise” is increasingly becoming a problem. In fact, fine-grained jobs on clusters with thousands of SMP...
186
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
135
click to vote
SODA
1994
ACM
15 years 7 months ago
1994
ACM
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
174
click to vote
AAECC
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...