Sciweavers

1053 search results - page 20 / 211
» On k-Path Covers and their applications
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 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
MICS
2010
128views more  MICS 2010»
13 years 3 months ago
Arrangements on Parametric Surfaces II: Concretizations and Applications
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...
Eric Berberich, Efi Fogel, Dan Halperin, Michael K...
DCC
2008
IEEE
14 years 8 months ago
An improved list decoding algorithm for the second order Reed-Muller codes and its applications
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
Rafaël Fourquet, Cédric Tavernier
FOCS
2009
IEEE
14 years 3 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
SIGCSE
2002
ACM
211views Education» more  SIGCSE 2002»
13 years 8 months ago
To java.net and beyond: teaching networking concepts using the Java networking API
This paper covers the use of Java and its API for developing networking programs in an undergraduate computer networks class. Through the use of TCP and UDP sockets provided in th...
Greg Gagne