Sciweavers

INFOCOM
2010
IEEE
13 years 8 months ago
Back-Pressure Routing for Intermittently Connected Networks
—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among di...
Jung Ryu, Lei Ying, Sanjay Shakkottai
INFOCOM
2010
IEEE
13 years 8 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
13 years 8 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
IJHPCA
2010
105views more  IJHPCA 2010»
13 years 8 months ago
A Pipelined Algorithm for Large, Irregular All-Gather Problems
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
Jesper Larsson Träff, Andreas Ripke, Christia...
KES
2008
Springer
13 years 8 months ago
Fast Cryptographic Privacy Preserving Association Rules Mining on Distributed Homogenous Data Base
Privacy is one of the most important properties of an information system must satisfy. In which systems the need to share information among different, not trusted entities, the pro...
Mahmoud Hussein, Ashraf El-Sisi, Nabil A. Ismail
KBS
2008
98views more  KBS 2008»
13 years 8 months ago
Mixed feature selection based on granulation and approximation
Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mai...
Qinghua Hu, Jinfu Liu, Daren Yu
IJBRA
2010
134views more  IJBRA 2010»
13 years 8 months ago
Deterministic graph-theoretic algorithm for detecting modules in biological interaction networks
—Accumulating evidence suggests that biological systems exhibit modular organization. Accurate identification of modularity is vital for understanding this organization. A recen...
Roger L. Chang, Feng Luo, Stuart Johnson, Richard ...
IEEEHPCS
2010
13 years 8 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
IEEECIT
2010
IEEE
13 years 8 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
IEEECIT
2010
IEEE
13 years 8 months ago
Robust Detection of Corners and Corner-line Links in Images
We define corner points in an image as the intersections among detected straight line segments, and propose an algorithm that detects corners from such a definition. Our corner det...
Andres Solis Montero, Milos Stojmenovic, Amiya Nay...