Sciweavers

1738 search results - page 108 / 348
» An algorithmic framework for network reconstruction
Sort
View
CORR
2011
Springer
203views Education» more  CORR 2011»
14 years 11 months ago
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
Laurent Jacques, Jason N. Laska, Petros Boufounos,...
SIGIR
2011
ACM
14 years 7 months ago
Learning online discussion structures by conditional random fields
Online forum discussions are emerging as valuable information repository, where knowledge is accumulated by the interaction among users, leading to multiple threads with structure...
Hongning Wang, Chi Wang, ChengXiang Zhai, Jiawei H...
ICA3PP
2010
Springer
15 years 9 months ago
Modular Resultant Algorithm for Graphics Processors
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Pavel Emeliyanenko
STACS
2007
Springer
15 years 10 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
WWW
2006
ACM
16 years 5 months ago
WAP5: black-box performance debugging for wide-area systems
Wide-area distributed applications are challenging to debug, optimize, and maintain. We present Wide-Area Project 5 (WAP5), which aims to make these tasks easier by exposing the c...
Patrick Reynolds, Janet L. Wiener, Jeffrey C. Mogu...