Sciweavers

CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 8 months ago
Integrating User's Domain Knowledge with Association Rule Mining
This paper presents a variation of Apriori algorithm that includes the role of domain expert to guide and speed up the overall knowledge discovery task. Usually, the user is inter...
Vikram Singh, Sapna Nagpal
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 8 months ago
Cooperative Algorithms for MIMO Interference Channels
Interference alignment is a transmission technique for exploiting all available degrees of freedom in the symmetric frequency- or time-selective interference channel with an arbit...
Steven W. Peters, Robert W. Heath Jr.
ANOR
2010
112views more  ANOR 2010»
13 years 8 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
AAECC
2010
Springer
123views Algorithms» more  AAECC 2010»
13 years 8 months ago
Algebraic change-point detection
Abstract Elementary techniques from operational calculus, differential algebra, and noncommutative algebra lead to a new approach for change-point detection, which is an important ...
Michel Fliess, Cédric Join, Mamadou Mboup
WIOPT
2010
IEEE
13 years 8 months ago
Low complexity algorithms for relay selection and power control in interference-limited environments
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Lazaros Gkatzikis, Iordanis Koutsopoulos
WEA
2010
Springer
208views Algorithms» more  WEA 2010»
13 years 8 months ago
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries
Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuse...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
WDAG
2010
Springer
182views Algorithms» more  WDAG 2010»
13 years 8 months ago
Scalable Flat-Combining Based Synchronous Queues
In a synchronous queue, producers and consumers handshake to exchange data. Recently, new scalable unfair synchronous queues were added to the Java JDK 6.0 to support high performa...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
WDAG
2010
Springer
196views Algorithms» more  WDAG 2010»
13 years 8 months ago
Brief Announcement: Failure Detectors Encapsulate Fairness
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
WDAG
2010
Springer
177views Algorithms» more  WDAG 2010»
13 years 8 months ago
Transactions as the Foundation of a Memory Consistency Model
We argue that traditional synchronization objects, such as locks, conditions, and atomic/volatile variables, should be defined in terms of transactions, rather than the other way ...
Luke Dalessandro, Michael L. Scott, Michael F. Spe...