Sciweavers

498 search results - page 31 / 100
» A Theory of Complexity for Continuous Time Systems
Sort
View
FOCS
1998
IEEE
13 years 11 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
MASCOTS
2010
13 years 8 months ago
Modeling the Run-time Behavior of Transactional Memory
In this paper, we develop a queuing theory based analytical model to evaluate the performance of transactional memory. Based on the statistical characteristics observed on actual e...
Zhengyu He, Bo Hong
STACS
2001
Springer
13 years 11 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
CIDR
2011
266views Algorithms» more  CIDR 2011»
12 years 11 months ago
Consistency in a Stream Warehouse
A stream warehouse is a Data Stream Management System (DSMS) that stores a very long history, e.g. years or decades; or equivalently a data warehouse that is continuously loaded. ...
Lukasz Golab, Theodore Johnson
TVCG
2011
125views more  TVCG 2011»
13 years 2 months ago
Video Painting with Space-Time-Varying Style Parameters
—Artists use different means of stylization to control the focus on different objects in the scene. This allows them to portray complex meaning and achieve certain artistic effec...
Mizuki Kagaya, William Brendel, Qingqing Deng, Tod...