Sciweavers

840 search results - page 70 / 168
» The Complexity of the Extended GCD Problem
Sort
View
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
14 years 8 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
EDBT
2008
ACM
135views Database» more  EDBT 2008»
14 years 8 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
ATAL
2009
Springer
14 years 2 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
C5
2006
IEEE
14 years 1 months ago
A Buffer Framework for Supporting Responsive Interaction in Information Visualization Interfaces
We present a framework that we are developing to better solve several critical issues that arise when interactive systems are extended to large displays. These issues include slow...
Tobias Isenberg, André Miede, M. Sheelagh T...
HICSS
2003
IEEE
99views Biometrics» more  HICSS 2003»
14 years 1 months ago
Towards Feasible Topology Formation Algorithms for Bluetooth-based WPANs
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BTWPANs). We first overview and extend a previously proposed centralized ...
Carla-Fabiana Chiasserini, Marco Ajmone Marsan, El...