Sciweavers

1554 search results - page 275 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
15 years 10 months ago
Compressing Historical Information in Sensor Networks
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
WWW
2010
ACM
15 years 5 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 4 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
GLOBECOM
2009
IEEE
15 years 4 months ago
Design of Signal Constellation Rearrangement (CoRe) for Multiple Relay Links
Abstract – This paper considers a design of signal constellations for trans-modulation (constellation rearrangement: CoRe) in a relay system with the multiple links in which the ...
Jin Woo Kim, Hee S. Lee, Jae Yung Ahn, Chung Gu Ka...
IWCMC
2009
ACM
15 years 4 months ago
Quantized transmit beamforming with antenna selection in a MIMO channel
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
Wiroonsak Santipach