Sciweavers

10891 search results - page 1813 / 2179
» Combining Model Reductions
Sort
View
122
Voted
EDBT
2008
ACM
111views Database» more  EDBT 2008»
16 years 3 months ago
Schema polynomials and applications
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
Kenneth A. Ross, Julia Stoyanovich
126
Voted
ICFP
2007
ACM
16 years 3 months ago
Adding delimited and composable control to a production programming environment
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
Matthew Flatt, Gang Yu, Robert Bruce Findler, Matt...
ICFP
2002
ACM
16 years 3 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani
131
Voted
ICFP
2001
ACM
16 years 3 months ago
Developing a Stage Lighting System from Scratch
Lula is a system for computer-assisted stage lighting design and control. Whereas other systems for the same purpose are usually the results of long chains of incremental improvem...
Michael Sperber
122
Voted
EWSN
2007
Springer
16 years 3 months ago
Removing Systematic Error in Node Localisation Using Scalable Data Fusion
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
Albert Krohn, Mike Hazas, Michael Beigl
« Prev « First page 1813 / 2179 Last » Next »