Sciweavers

1734 search results - page 14 / 347
» its 2000
Sort
View
COMBINATORICS
2000
120views more  COMBINATORICS 2000»
14 years 9 months ago
The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
Elias M. Hagos
COMBINATORICA
2000
157views more  COMBINATORICA 2000»
14 years 9 months ago
Concentration of Multivariate Polynomials and Its Applications
Suppose t1, ..., tn are independent random variables which take value either 0 or 1, and Y is a multi-variable polynomial in ti's with positive coefficients. We give a conditi...
Jeong Han Kim, Van H. Vu
MVA
2000
160views Computer Vision» more  MVA 2000»
14 years 11 months ago
Self-Calibration from Optical Flow and Its Reliability Evaluation
An algorithm is presented for 3-D reconstruction from optical flow observed by an uncalibrated camera. We show that by incorporating a statistical model of image noise, we can not...
Kenichi Kanatani
FGCS
2000
83views more  FGCS 2000»
14 years 9 months ago
A Graph-based Ant System and its convergence
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
Walter J. Gutjahr
ICDE
2000
IEEE
101views Database» more  ICDE 2000»
15 years 11 months ago
DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes
This paper introduces the concept of letting an RDBMS Optimizer optimize its own environment. In our project, we have used the DB2 Optimizer to tackle the index selection problem,...
Gary Valentin, Michael Zuliani, Daniel C. Zilio, G...