Sciweavers

1056 search results - page 180 / 212
» Handbook of mathematical functions
Sort
View
COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 9 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber
RC
2000
99views more  RC 2000»
13 years 9 months ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden
IM
2007
13 years 9 months ago
PageRank of Scale-Free Growing Networks
PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of Web page visits by a random surfer and thus it r...
Konstantin Avrachenkov, Dmitri Lebedev
COMBINATORICS
1998
86views more  COMBINATORICS 1998»
13 years 9 months ago
Lattice Tilings by Cubes: Whole, Notched and Extended
We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
Mihail N. Kolountzakis
APIN
1999
114views more  APIN 1999»
13 years 9 months ago
Evolutionary Approaches to Figure-Ground Separation
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
Suchendra M. Bhandarkar, Xia Zeng