Sciweavers

2031 search results - page 325 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
MOBIHOC
2007
ACM
14 years 9 months ago
Allocating dynamic time-spectrum blocks in cognitive radio networks
A number of studies have shown the abundance of unused spectrum in the TV bands. This is in stark contrast to the overcrowding of wireless devices in the ISM bands. A recent trend...
Yuan Yuan, Paramvir Bahl, Ranveer Chandra, Thomas ...
CSCW
2010
ACM
14 years 6 months ago
Social use of computer-mediated communication by adults on the autism spectrum
The defining characteristics of autism, including difficulty with nonverbal cues and need for structure, and the defining characteristics of computer-mediated communication (CMC),...
Moira Burke, Robert Kraut, Diane Williams
FPGA
2010
ACM
276views FPGA» more  FPGA 2010»
14 years 6 months ago
Accelerating Monte Carlo based SSTA using FPGA
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we acc...
Jason Cong, Karthik Gururaj, Wei Jiang, Bin Liu, K...
CVPR
2010
IEEE
14 years 6 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
CVPR
2010
IEEE
14 years 6 months ago
On Growth and Formlets: Sparse Multi-Scale Coding of Planar Shape
This paper presents a sparse representation of 2D planar shape through the composition of warping functions, termed formlets, localized in scale and space. Each formlet subjects t...
Timothy Oleskiw, James Elder, Gabriel Peyr