Sciweavers

35419 search results - page 6863 / 7084
» How are we doing
Sort
View
SIGCOMM
2005
ACM
15 years 10 months ago
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs
We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practica...
Martin Heusse, Franck Rousseau, Romaric Guillier, ...
156
Voted
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
13 years 7 months ago
Parallelism and time in hierarchical self-assembly
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
Ho-Lin Chen, David Doty
ICCV
2007
IEEE
16 years 6 months ago
3-D Reconstruction from Sparse Views using Monocular Vision
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...
Ashutosh Saxena, Min Sun, Andrew Y. Ng
ICCV
2005
IEEE
16 years 6 months ago
Efficient Learning of Relational Object Class Models
We present an efficient method for learning part-based object class models from unsegmented images represented as sets of salient features. A model includes parts' appearance...
Aharon Bar-Hillel, Tomer Hertz, Daphna Weinshall
ICCV
2005
IEEE
16 years 6 months ago
A Graph Cut Algorithm for Generalized Image Deconvolution
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
Ashish Raj, Ramin Zabih
« Prev « First page 6863 / 7084 Last » Next »