Sciweavers

280 search results - page 24 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
DSN
2007
IEEE
15 years 10 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
VTC
2010
IEEE
176views Communications» more  VTC 2010»
15 years 4 months ago
Subcarrier Allocation for Multiuser Two-Way OFDMA Relay Networks with Fairness Constraints
—In this paper, we propose a new adaptive subcarrier allocation for a multiuser two-way OFDMA relay network. In the proposed algorithm, subcarriers are allocated to the user-pair...
Hanmok Shin, Jae Hong Lee
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
14 years 8 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
ICDE
2008
IEEE
395views Database» more  ICDE 2008»
17 years 5 months ago
PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
ICDT
2001
ACM
124views Database» more  ICDT 2001»
15 years 10 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...