Sciweavers

258 search results - page 3 / 52
» Relational Correspondences for Lattices with Operators
Sort
View
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
14 years 7 months ago
On Pushing Multilingual Query Operators into Relational Engines
To effectively support today's global economy, database systems need to manage data in multiple languages simultaneously. While current database systems do support the storag...
A. Kumaran, Pavan K. Chowdary, Jayant R. Haritsa
COMBINATORICS
2007
81views more  COMBINATORICS 2007»
13 years 6 months ago
The m-Colored Composition Poset
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
Brian Drake, T. Kyle Petersen
ENTCS
2006
273views more  ENTCS 2006»
13 years 6 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
ISCAS
2007
IEEE
93views Hardware» more  ISCAS 2007»
14 years 13 days ago
VLSI Implementation of a Lattice-Reduction Algorithm for Multi-Antenna Broadcast Precoding
Abstract— This paper describes the first VLSI implementation of lattice reduction (LR) aided multi-antenna broadcast precoding with vector perturbation. The considered LR scheme...
Andreas Burg, Dominik Seethaler, Gerald Matz
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 6 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson