Sciweavers

1647 search results - page 220 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
110
Voted
DAC
2007
ACM
16 years 3 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
15 years 3 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane
TWC
2008
140views more  TWC 2008»
15 years 2 months ago
Exclusive-Region Based Scheduling Algorithms for UWB WPAN
With the capability of supporting very high data rate services in a short range, Ultra-Wideband (UWB) technology is appealing to multimedia applications in future wireless personal...
Kuang-Hao Liu, Lin Cai, Xuemin Shen
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 2 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
139
Voted
ICML
2008
IEEE
16 years 3 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash