ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 107,488 of 1,394,228
|
|
Results 1 - 20 of 107,488
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
Multivariate Bernstein and Markov inequalities
|
|
September 1992
|
|
Journal of Approximation Theory
, Volume 70 Issue 3
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
 |
|
|
|
|
2
|
|
3
|
|
A characterization for a set of partial partitions to define an X-tree
|
|
March 2002
|
|
Discrete Mathematics
, Volume 247 Issue 1-3
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
Trees whose vertices are partially labelled by elements of a finite set X provide a natural way to represent partitions of subsets of X. The condition under which a given collection of such partial partitions of X can be represented ...
Keywords: X-trees, chordal graphs, free X-trees, partition intersection graphs
|
|
4
|
|
5
|
|
Simulation of the switching curve in antiferromagnetic ising model
|
|
September 2003
|
|
ICCMSE '03: Proceedings of the international conference on Computational methods in sciences and engineering
|
|
Publisher: World Scientific Publishing Co., Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
At sufficiently low temperatures T we expect all spins in the antiferromagnetic ground state for a finite net size. Then we apply magnetic field +H on spins "down" sublattice and -H on spins "up" sublattice to provoke spin reversals ...
|
|
6
|
|
Bipartite Subgraphs and Quasi-Randomness
|
|
June 2004
|
|
Graphs and Combinatorics
, Volume 20 Issue 2
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
We say that a family of graphs * is p-quasi-random, 0<p<1, if it shares typical properties of the random graph G(n,p); for a definition, see below. We denote by * the class of all graphs H for which * and ...
|
|
7
|
|
8
|
|
Recursive monadic bindings
|
|
September 2000
|
|
ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(689.66 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 3, Downloads (12 Months): 40, Downloads (Overall): 197, Citation Count: 9 |
|
|
Monads have become a popular tool for dealing with computational effects in Haskell for two significant reasons: equational reasoning is retained even in the presence of effects; and program modularity is enhanced by hiding "plumbing" issues inside the ...
|
Also published in: |
| September 2000 |
SIGPLAN Notices |
Volume 35 Issue 9 |
|
|
9
|
|
10
|
|
Comparing queues and stacks as mechanisms for laying out graphs
|
|
August 1992
|
|
SIAM Journal on Discrete Mathematics
, Volume 5 Issue 3
|
|
Publisher: Society for Industrial and Applied Mathematics
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 7 |
|
|
|
Keywords: book embedding, graph embedding, queue layout, stack layout, ternary hypercube
|
|
11
|
|
12
|
|
13
|
|
Several Concepts to Investigate Strongly Nonnormal Eigenvalue Problems
|
|
March 2002
|
|
SIAM Journal on Scientific Computing
, Volume 24 Issue 3
|
|
Publisher: Society for Industrial and Applied Mathematics
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Eigenvalue analysis plays an important role in understanding physical phenomena. However, if one deals with strongly nonnormal matrices or operators, the eigenvalues alone may not tell the full story. A well-known tool which can be useful to get more ...
Keywords: $\varepsilon$-pseudospectra, Alfvén spectrum, condition numbers, eigenvalue problem, eigenvalues, generalized eigenvalue problem, invariant subspaces, magnetohydrodynamics, nonnormality
|
|
14
|
|
15
|
|
Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
|
|
May 2006
|
|
Neural Computation
, Volume 18 Issue 5
|
|
Publisher: MIT Press
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
Evolutionary game-theoretic models and, in particular, the so-called replicator equations have recently proven to be remarkably effective at approximately solving the maximum clique and related problems. The approach is centered around a classic result ...
|
|
16
|
|
Delay structure conditions for identifiability of closed loop systems
|
|
September 1992
|
|
Automatica (Journal of IFAC)
, Volume 28 Issue 5
|
|
Publisher: Pergamon Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
Keywords: closed loop system, identifiability, linear systems, system identification
|
|
17
|
|
A geometric interpretation of an equality by Sylvester
|
|
September 1997
|
|
Proceedings of the international conference on Combinatorics '94
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
Also published in: |
| September 1997 |
Discrete Mathematics |
Volume 174 Issue 1-3 |
|
|
18
|
|
Electron outflow in axisymmetric pulsar magnetospheres. II.
|
|
October 1987
|
|
Australian Journal of Physics
, Volume 40 Issue 5
|
|
Publisher: Commonwealth Scientific and Industrial Research Organization
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
19
|
|
20
|
|
Factorizations of an n-cycle into two n-cycles
|
|
October 2003
|
|
European Journal of Combinatorics
, Volume 24 Issue 7
|
|
Publisher: Academic Press Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
We prove by elementary combinatorial methods that the number of factorizations of an n-cycle (with n odd) into the product of two n-cycles is 2(n - 1)!/(n + 1). Moreover, we generalize our method to the factorization ...
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site