Sciweavers

6279 search results - page 397 / 1256
» Studies in Solution Sampling
Sort
View
STOC
2007
ACM
108views Algorithms» more  STOC 2007»
16 years 7 months ago
Combinatorial complexity in O-minimal geometry
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
Saugata Basu
PODS
2003
ACM
107views Database» more  PODS 2003»
16 years 6 months ago
E-services: a look behind the curtain
The emerging paradigm of electronic services promises to bring to distributed computation and services the flexibility that the web has brought to the sharing of documents. An und...
Richard Hull, Michael Benedikt, Vassilis Christoph...
DCC
2007
IEEE
16 years 6 months ago
Quantization of Sparse Representations
Compressive sensing (CS) is a new signal acquisition technique for sparse and compressible signals. Rather than uniformly sampling the signal, CS computes inner products with rand...
Petros Boufounos, Richard G. Baraniuk
SDM
2009
SIAM
113views Data Mining» more  SDM 2009»
16 years 4 months ago
Graph Generation with Prescribed Feature Constraints.
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
Xiaowei Ying, Xintao Wu
CHI
2010
ACM
16 years 1 months ago
Lightweight selective availability in instant messaging
Selective availability in instant messaging can improve connectiveness while at the same time keeping disruption low. In this paper we report on an experience sampling study of se...
Mirko Fetter, Julian Seifert, Tom Gross