Sciweavers

3244 search results - page 267 / 649
» On convex complexity measures
Sort
View
AAAI
1998
15 years 8 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
WSC
1998
15 years 8 months ago
A Speculation-based Approach for Performance and Dependability Analysis: A Case Study
In this paper, we propose two speculation-based methods for fast and accurate simulation-based performance and dependability analysis of complex systems, incorporating detailed si...
Yiqing Huang, Zbigniew Kalbarczyk, Ravishankar K. ...
SOFTVIS
2010
ACM
15 years 6 months ago
3D kiviat diagrams for the interactive analysis of software metric trends
Previous techniques for visualizing time-series of multivariate data mostly plot the time along additional axes, are often complex, and does not support intuitive interaction. In ...
Andreas Kerren, Ilir Jusufi
ICASSP
2010
IEEE
15 years 6 months ago
Texas Hold 'Em algorithms for distributed compressive sensing
This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlati...
Stephen R. Schnelle, Jason N. Laska, Chinmay Hegde...
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 6 months ago
Quantifying Homology Classes
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
Chao Chen, Daniel Freedman