Sciweavers

541 search results - page 33 / 109
» Applications of nonstandard analysis in additive number theo...
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Restricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
Holger Rauhut, Justin K. Romberg, Joel A. Tropp
SPAA
2009
ACM
16 years 28 days ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 7 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
SIGMOD
2009
ACM
139views Database» more  SIGMOD 2009»
16 years 6 months ago
Detecting and resolving unsound workflow views for correct provenance analysis
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
Peng Sun, Ziyang Liu, Susan B. Davidson, Yi Chen