Sciweavers

4860 search results - page 82 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CJ
2010
98views more  CJ 2010»
13 years 7 months ago
On Ultrametric Algorithmic Information
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...
Fionn Murtagh
CVPR
2004
IEEE
14 years 9 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 2 months ago
Complexity and Error Propagation of Localization Using Interferometric Ranging
— An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as receive...
Rui Huang, Gergely V. Záruba, Manfred Huber
COCOON
2008
Springer
13 years 9 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
ICFP
2006
ACM
14 years 7 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross