Sciweavers

84 search results - page 14 / 17
» Maximum Betweenness Centrality: Approximability and Tractabl...
Sort
View
SPAA
2004
ACM
15 years 3 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
TSP
2010
14 years 4 months ago
Source extraction by maximizing the variance in the conditional distribution tails
This paper presents a method for signal extraction based on conditional second-order moments of the output of the extraction filter. The estimator of the filter is derived from an ...
Ronald Phlypo, Vicente Zarzoso, Ignace Lemahieu
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
15 years 10 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
MST
2006
149views more  MST 2006»
14 years 9 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
JMLR
2012
13 years 2 days ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss