Sciweavers

5100 search results - page 630 / 1020
» The Linear Complexity of a Graph
Sort
View
141
Voted
PPOPP
2010
ACM
16 years 4 months ago
Fast tridiagonal solvers on the GPU
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
Yao Zhang, Jonathan Cohen, John D. Owens
CVPR
2010
IEEE
16 years 3 months ago
Spike Train Driven Dynamical Models for Human Actions
We investigate dynamical models of human motion that can support both synthesis and analysis tasks. Unlike coarser discriminative models that work well when action classes are ...
Michalis Raptis, Kamil Wnuk , Stefano Soatto
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
16 years 1 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
ICASSP
2009
IEEE
16 years 1 months ago
RLS-weighted Lasso for adaptive estimation of sparse signals
The batch least-absolute shrinkage and selection operator (Lasso) has well-documented merits for estimating sparse signals of interest emerging in various applications, where obse...
Daniele Angelosante, Georgios B. Giannakis
FC
2009
Springer
118views Cryptology» more  FC 2009»
16 years 1 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...