Sciweavers

6833 search results - page 345 / 1367
» Some two-character sets
Sort
View
SIAMJO
2008
104views more  SIAMJO 2008»
15 years 6 months ago
A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...
Seung-Jean Kim, Stephen P. Boyd
APPML
2005
55views more  APPML 2005»
15 years 6 months ago
Recovering a phylogenetic tree using pairwise closure operations
A fundamental task in evolutionary biology is the amalgamation of a collection P of leaf-labelled trees into a single parent tree. A desirable feature of any such amalgamation is ...
Katharina T. Huber, Vincent Moulton, Charles Sempl...
INFORMATICALT
2007
43views more  INFORMATICALT 2007»
15 years 6 months ago
Functional Test Generation Based on Combined Random and Deterministic Search Methods
Abstract. The aim of this paper is to explore some features of the functional test generation problem, and on the basis of the gained experience, to propose a practical method for ...
Eduardas Bareisa, Vacius Jusas, Kestutis Motiejuna...
DM
2002
92views more  DM 2002»
15 years 6 months ago
A local-global principle for vertex-isoperimetric problems
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
Sergei L. Bezrukov, Oriol Serra
DM
2002
91views more  DM 2002»
15 years 6 months ago
A disproof of Henning's conjecture on irredundance perfect graphs
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
Lutz Volkmann, Vadim E. Zverovich