Oct
27
The Real Logic of Drawing Graphs
Speaker Marcus Schaefer DePaul University http://ovid.cs.depaul.edu/ Description We study the complexity of several geometric graph drawing problems, including the recognition problem for intersection...
Events Archive
Find an Event
Oct
27
NAG Presentation and Demonstration on Computational Optimization and its Applications
Description NAG invites you to join an innovative presentation hosted at the Illinois Institute of Technology that includes a selection of software demonstrations, as well as a detailed discussion...
Oct
24
Pricing CDS Index Options in a Nonlinear Filtering Model
SpeakerDr. Alexander HerbertssonUniversity of Gothenburg, Swedenhttp://www.economics.handels.gu.se/english/staff/senior_lecturers-lecturers-_researchers/alexander_herbertsson/ Description We derive...
Oct
24
Optimal Design When Gradient Information is Available
Event Topic: Computational Mathematics & Statistics
Oct
19
Modeling Self-Organizing Networks
Description One of the most characteristic features of a graph corresponding to many self-organizing networks is its degree sequence, in which the fraction of vertices of degree larger than k...
Oct
19
On the Traveling Wave Solutions for a Nonlinear Diffusion-Convection Equation: Dynamical System Approach
Description The existence of uncountably infinite global monotonic wavefront solutions and semi-wavefront solutions with bounded support is proved for a general nonlinear diffusion-convection equation...
Oct
17
Vector-Valued Parametric Kernal-Based Interpolation for 2D Facial Animations
Event Topic: Computational Mathematics & Statistics
Oct
14
A Generalization of Kernel For Function Approximation
Event Topic: Computational Mathematics & Statistics
Oct
13
Step Dynamics and Morphological Instabilities During Epitaxial Growth
Description Vicinal surfaces consist of terraces separated by atomic steps. During step-flow epitaxial growth, adsorbed atoms (from the vapor or a beam) diffuse on the terraces until they attach to...
Oct
5
Sampling Within k-Means Algorithm to Cluster Large Datasets
Description Due to current data collection technology, our ability to gather data has surpassed our ability to analyze it. In particular, k-means, one of the simplest and fastest clustering algorithms...