Sciweavers

1604 search results - page 271 / 321
» Approximation algorithms for developable surfaces
Sort
View
ECCV
2006
Springer
14 years 10 months ago
A Theory of Spherical Harmonic Identities for BRDF/Lighting Transfer and Image Consistency
Abstract. We develop new mathematical results based on the spherical harmonic convolution framework for reflection from a curved surface. We derive novel identities, which are the ...
Dhruv Mahajan, Ravi Ramamoorthi, Brian Curless
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 2 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 6 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
IPSN
2009
Springer
14 years 3 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 9 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram