Sciweavers

1094 search results - page 125 / 219
» One Size Fits All
Sort
View
VLDB
2005
ACM
121views Database» more  VLDB 2005»
14 years 9 months ago
Join operations in temporal databases
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
Dengfeng Gao, Christian S. Jensen, Richard T. Snod...
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 9 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
DCC
2002
IEEE
14 years 8 months ago
Globally Optimal Uneven Error-Protected Packetization of Scalable Code Streams
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
Sorina Dumitrescu, Xiaolin Wu, Zhe Wang
GLOBECOM
2009
IEEE
14 years 3 months ago
Optimal Resource Allocation in the OFDMA Downlink with Feedback of Buffer State Information
—With the advent of new applications, one of the primary applications supported in downlink cellular systems is streaming video. QoS for streaming video entails data transmission...
Rajiv Agarwal, John M. Cioffi
COMPGEOM
2009
ACM
14 years 3 months ago
On grids in topological graphs
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
Eyal Ackerman, Jacob Fox, János Pach, Andre...