Sciweavers

1477 search results - page 255 / 296
» Random Convex Programs
Sort
View
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 8 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
ICALP
2009
Springer
14 years 8 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 7 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
ICCD
2008
IEEE
111views Hardware» more  ICCD 2008»
14 years 4 months ago
Test-access mechanism optimization for core-based three-dimensional SOCs
— Test-access mechanisms (TAMs) and test wrappers (e.g., the IEEE Standard 1500 wrapper) facilitate the modular testing of embedded cores in a core-based system-on-chip (SOC). Su...
Xiaoxia Wu, Yibo Chen, Krishnendu Chakrabarty, Yua...
CVPR
2010
IEEE
14 years 3 months ago
Energy Minimization for Linear Envelope MRFs
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
Pushmeet Kohli, M. Pawan Kumar