Sciweavers

1996 search results - page 117 / 400
» Financial Theory 2
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 10 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 10 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
TABLETOP
2008
IEEE
14 years 4 months ago
From DigiQuilt to DigiTile: Adapting educational technology to a multi-touch table
To realize the potential of multi-touch tables, interaction designers need to create meaningful applications for them in real-world contexts. One convenient shortcut towards that ...
Jochen Rick, Yvonne Rogers
VTC
2008
IEEE
224views Communications» more  VTC 2008»
14 years 4 months ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang
ICC
2007
IEEE
120views Communications» more  ICC 2007»
14 years 4 months ago
Maximizing Throughput in Layered Peer-to-Peer Streaming
—Layered streaming is an effective solution to address the receiver heterogeneity in peer-to-peer (P2P) multimedia distribution. This paper targets a fundamental challenge in thi...
Liang Dai, Yi Cui, Yuan Xue