Sciweavers

1019 search results - page 91 / 204
» Uniform Functors on Sets
Sort
View
TIME
2002
IEEE
14 years 1 months ago
A Logical Approach to Represent and Reason about Calendars
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
Carlo Combi, Massimo Franceschet, Adriano Peron
AISC
2010
Springer
14 years 1 months ago
Symbolic Domain Decomposition
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
Jacques Carette, Alan P. Sexton, Volker Sorge, Ste...
ICMCS
2000
IEEE
86views Multimedia» more  ICMCS 2000»
14 years 1 months ago
Water-Filling for Watermarking?
In this paper we address the question: Is water-filling appropriate for watermarking? The water-filling paradigm is a traditional solution to the capacity maximization of parall...
Deepa Kundur
FOCS
1999
IEEE
14 years 1 months ago
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
V. S. Anil Kumar, H. Ramesh
ERSHOV
1999
Springer
14 years 1 months ago
Binding-Time Analysis in Partial Evaluation: One Size Does Not Fit All
Abstract. Existing partial evaluators usually fix the strategy for binding-time analysis. But a single strategy cannot fulfill all goals without leading to compromises regarding ...
Niels H. Christensen, Robert Glück, Sø...