Sciweavers

8512 search results - page 1701 / 1703
» Computing Theory With Relevance
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 3 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
ER
2007
Springer
237views Database» more  ER 2007»
14 years 2 months ago
Business Process and Business Rule Modeling Languages for Compliance Management: A Representational Analysis
Organizations are under increasing scrutiny to document their compliance to regulatory requirements. To this end, they have to formally document their operating procedures to supp...
Michael zur Muehlen, Marta Indulska, Gerrit Kamp
SIGCOMM
2012
ACM
11 years 10 months ago
Perspectives on network calculus: no free lunch, but still good value
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...
Florin Ciucu, Jens Schmitt
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 10 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
SIAMCOMP
2012
11 years 10 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
« Prev « First page 1701 / 1703 Last » Next »