Sciweavers

2215 search results - page 163 / 443
» Wide open spaces
Sort
View
MFCS
2005
Springer
15 years 10 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
SOCO
2005
Springer
15 years 10 months ago
Directory Support for Large-Scale, Automated Service Composition
In an open environment populated by large numbers of services, automated service composition is a major challenge. In such a setting the efficient interaction of directory-based s...
Walter Binder, Ion Constantinescu, Boi Faltings
NIME
2004
Springer
114views Music» more  NIME 2004»
15 years 10 months ago
Tree Music: Composing with GAIA
In this report, we discuss Tree Music, an interactive computer music installation created using GAIA (Graphical Audio Interface Application), a new open-source interface for contr...
Judith Shatin, David Topper
SBCCI
2003
ACM
135views VLSI» more  SBCCI 2003»
15 years 9 months ago
Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
Mauricio Ayala-Rincón, Rodrigo B. Nogueira,...
COMPGEOM
2010
ACM
15 years 9 months ago
Lines avoiding balls in three dimensions revisited
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
Natan Rubin