Sciweavers

514 search results - page 42 / 103
» Foundations of Aggregation Constraints
Sort
View
POPL
2002
ACM
14 years 8 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
14 years 1 months ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
FOCS
1992
IEEE
14 years 4 days ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 8 months ago
Outage Capacity of the Fading Relay Channel in the Low SNR Regime
In this paper we look at the outage capacity of the fading relay channel with half-duplex constraint in the low SNR regime. First we consider the scenario that the channel state i...
Amir Salman Avestimehr, David N. C. Tse
PVLDB
2010
96views more  PVLDB 2010»
13 years 6 months ago
Scalable Data Exchange with Functional Dependencies
The recent literature has provided a solid theoretical foundation for the use of schema mappings in data-exchange applications. Following this formalization, new algorithms have b...
Bruno Marnette, Giansalvatore Mecca, Paolo Papotti