Sciweavers

7930 search results - page 1322 / 1586
» Greedy in Approximation Algorithms
Sort
View
JMLR
2012
13 years 7 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
CAV
2012
Springer
231views Hardware» more  CAV 2012»
13 years 7 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
CVPR
2012
IEEE
13 years 7 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
TVCG
2012
181views Hardware» more  TVCG 2012»
13 years 7 months ago
Interactive Image Segmentation Based on Level Sets of Probabilities
—In this paper, we present a robust and accurate algorithm for interactive image segmentation. The level set method is clearly advantageous for image objects with a complex topol...
Yugang Liu, Yizhou Yu
SIGMETRICS
2012
ACM
247views Hardware» more  SIGMETRICS 2012»
13 years 7 months ago
A scalable architecture for maintaining packet latency measurements
Latency has become an important metric for network monitoring since the emergence of new latency-sensitive applications (e.g., algorithmic trading and high-performance computing)....
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
« Prev « First page 1322 / 1586 Last » Next »