Sciweavers

221 search results - page 35 / 45
» An Improved Approximation Algorithm for the Column Subset Se...
Sort
View
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 7 months ago
Feature Construction for Relational Sequence Learning
Abstract. We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
WSCG
2004
143views more  WSCG 2004»
13 years 9 months ago
View Dependent Stochastic Sampling for Efficient Rendering of Point Sampled Surfaces
In this paper we present a new technique for rendering very large datasets representing point-sampled surfaces. Rendering efficiency is considerably improved by using stochastic s...
Sushil Bhakar, Liang Luo, Sudhir P. Mudur
INFOCOM
2010
IEEE
13 years 7 months ago
Topology Control for Effective Interference Cancellation in Multi-User MIMO Networks
—In Multi-User MIMO networks, receivers decode multiple concurrent signals using Successive Interference Cancellation (SIC). With SIC a weak target signal can be deciphered in th...
Ece Gelal, Konstantinos Pelechrinis, Tae-Suk Kim, ...
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 1 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun