Sciweavers

1399 search results - page 35 / 280
» New Algorithms for k-Center and Extensions
Sort
View
RECOMB
2001
Springer
14 years 9 months ago
Algorithms for phylogenetic footprinting
Phylogenetic footprinting is a comparative genomics approach for predicting transcription factor binding sites, where a set of orthologous regulatory regions are compared and short...
Mathieu Blanchette
CVPR
2011
IEEE
13 years 5 months ago
Multi-spectral SIFT for Scene Category Recognition
We use a simple modification to a conventional SLR camera to capture images of several hundred scenes in colour (RGB) and near-infrared (NIR). We show that the addition of near-i...
Matthew Brown, Sabine Susstrunk
ICCV
2009
IEEE
13 years 7 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
INFOCOM
2011
IEEE
13 years 29 days ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
CORR
2012
Springer
209views Education» more  CORR 2012»
12 years 5 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii