Sciweavers

63 search results - page 2 / 13
» Improved bounds for dictionary look-up with one error
Sort
View
ASPDAC
2010
ACM
137views Hardware» more  ASPDAC 2010»
13 years 3 months ago
Managing verification error traces with bounded model debugging
Managing long verification error traces is one of the key challenges of automated debugging engines. Today, debuggers rely on the iterative logic array to model sequential behavior...
Sean Safarpour, Andreas G. Veneris, Farid N. Najm
ICDCSW
2005
IEEE
13 years 11 months ago
Cluster-Based Intelligent Searching in Unstructured Peer-to-Peer Networks
Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exist...
Xiuqi Li, Jie Wu
WAIM
2007
Springer
13 years 11 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 6 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 5 months ago
Sensing Matrix Optimization for Block-Sparse Decoding
Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a welldesign...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...