14699 search results - page 337 / 2940 » Complexity and Cognitive Computing |
127
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
139
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
125
click to vote
ISSAC
2005
Springer
15 years 10 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
151
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
147
click to vote
WACV
2002
IEEE
15 years 9 months ago
2002
IEEE
3D models of urban sites with geometry and facade textures are needed for many planning and visualization applications. Approximate 3D wireframe model can be derived from aerial i...