Sciweavers

5055 search results - page 316 / 1011
» Relative Timing
Sort
View
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
16 years 7 months ago
Temporal Coalescing with Now, Granularity, and Incomplete Information
This paper presents a novel strategy for temporal coalescing. Temporal coalescing merges the temporal extents of value-equivalent tuples. A temporal extent is usually coalesced of...
Curtis E. Dyreson
SIGMOD
2002
ACM
119views Database» more  SIGMOD 2002»
16 years 7 months ago
Rate-based query optimization for streaming information sources
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
Stratis Viglas, Jeffrey F. Naughton
CTRSA
2009
Springer
155views Cryptology» more  CTRSA 2009»
16 years 2 months ago
Cryptanalysis of CTC2
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...
Orr Dunkelman, Nathan Keller
ICECCS
2009
IEEE
119views Hardware» more  ICECCS 2009»
16 years 1 months ago
REMES: A Resource Model for Embedded Systems
In this paper, we introduce the model REMES for formal modeling and analysis of embedded resources such as storage, energy, communication, and computation. The model is a state-ma...
Cristina Cerschi Seceleanu, Aneta Vulgarakis, Paul...
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...