Sciweavers

1998 search results - page 349 / 400
» Complexity of the Cover Polynomial
Sort
View
INFOCOM
2011
IEEE
13 years 1 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
ICALP
2011
Springer
13 years 1 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
IJCV
2012
12 years 10 days ago
Globally Optimal Estimation of Nonrigid Image Distortion
Abstract Image alignment in the presence of non-rigid distortions is a challenging task. Typically, this involves estimating the parameters of a dense deformation field that warps...
Yuandong Tian, Srinivasa G. Narasimhan
CVPR
2004
IEEE
14 years 12 months ago
Linear Model Hashing and Batch RANSAC for Rapid and Accurate Object Recognition
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
Ying Shan, Bogdan Matei, Harpreet S. Sawhney, Rake...
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 10 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin