Sciweavers

1576 search results - page 136 / 316
» Streaming Algorithms for Independent Sets
Sort
View
98
Voted
JIIS
2008
133views more  JIIS 2008»
14 years 10 months ago
Maintaining frequent closed itemsets over a sliding window
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
James Cheng, Yiping Ke, Wilfred Ng
ICRA
2008
IEEE
165views Robotics» more  ICRA 2008»
15 years 4 months ago
An almost communication-less approach to task allocation for multiple Unmanned Aerial Vehicles
— In this paper, we present a scalable, decentralized task allocation algorithm for a group of unknown number of Unmanned Aerial Vehicles (UAVs), which are equipped with GPS rece...
Peng Cheng, Vijay Kumar
111
Voted
ISAAC
2007
Springer
118views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Dynamic Structures for Top- k Queries on Uncertain Data
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
Jiang Chen, Ke Yi
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
14 years 10 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
79
Voted
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 8 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan