Sciweavers

1523 search results - page 294 / 305
» The Computational Complexity of Linear Optics
Sort
View
IVC
2007
131views more  IVC 2007»
13 years 7 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...
CN
2002
82views more  CN 2002»
13 years 7 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
TKDE
2008
141views more  TKDE 2008»
13 years 7 months ago
Location Fingerprinting In A Decorrelated Space
We present a novel approach to the problem of the indoor localization in wireless environments. The main contribution of this paper is four folds: (a) We show that, by projecting t...
Shih-Hau Fang, Tsung-Nan Lin, Po-Chiang Lin
WABI
2010
Springer
128views Bioinformatics» more  WABI 2010»
13 years 5 months ago
Sparsification of RNA Structure Prediction Including Pseudoknots
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...
Mathias Möhl, Raheleh Salari, Sebastian Will,...
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 2 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena