Sciweavers

244 search results - page 41 / 49
» Compressive PCA on Graphs
Sort
View
BNCOD
2004
85views Database» more  BNCOD 2004»
13 years 11 months ago
Database Support for Path Query Functions
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
Rachel Hamill, Nigel J. Martin
MST
2010
107views more  MST 2010»
13 years 8 months ago
Fixed-Parameter Algorithms for Cluster Vertex Deletion
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
Falk Hüffner, Christian Komusiewicz, Hannes M...
ACL
2010
13 years 7 months ago
Automatic Generation of Story Highlights
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...
Kristian Woodsend, Mirella Lapata
ICASSP
2011
IEEE
13 years 1 months ago
Dual constrained TV-based regularization
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
Camille Couprie, Hugues Talbot, Jean-Christophe Pe...
INFOCOM
2009
IEEE
14 years 4 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar