844 search results - page 75 / 169 » Solving the p |
154
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
164
click to vote
ESCIENCE
2006
IEEE
15 years 9 months ago
2006
IEEE
The field of e-science currently faces many challenges. Among the most important ones are the analysis of huge volumes of scientific data and the connection of various sciences an...
158
click to vote
WOB
2003
15 years 6 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
158
click to vote
ALGORITHMICA
2007
15 years 5 months ago
2007
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
144
click to vote
CSDA
2006
15 years 5 months ago
2006
Several methods to select variables that are subsequently used in discriminant analysis are proposed and analysed. The aim is to find from among a set of m variables a smaller sub...