Events Archive

Find an Event

Feb
21

Time

to

Locations

E1 244

Locations

Description Abstract We analyze one redundant aspect of the encoder for the Lempel-Ziv '77 data compression algorithm. We prove that the number of pointers into the LZ'77 database asymptotically...

Nov
29

Time

to

Locations

E1 Room 242

Locations

Description Strongly chordal graphs were introduced by Farber in 1983, as a restricted class of graphs for which the weighted dominating set problem can be solved in polynomial time; the problem is NP...

Nov
8

Time

to

Locations

E1 Room 242

Locations

Description We discuss how the boundary concept can be used to describe fractal sets. Two examples illustrate this: 1. Polynomial endomorphisms of C2 and their Julia sets; 2. Self-similar fractals...

Oct
25

Time

to

Locations

E1 Room 242

Locations

Description Covering codes, which are sets of Hamming balls which cover the discrete hypercube, have been studied in many settings, including betting on football pools with a fixed number of matches...

Oct
18

Time

to

Locations

E1 Room 242

Locations

Description The presentation has two parts. One is about FDM application in the material process. The other is about FEM application ( only several slides). The diffusion equation of carbon...

Feb
16

Time

to

Locations

E1 Room 244

Locations

SpeakerChi-Wang ShuDivision of Applied Mathematics, Brown Universityhttp://www.dam.brown.edu/people/shu/home.html Description WENO (weighted essentially non-oscillatory) schemes are high order finite...

Feb
2

Time

to

Locations

E1 244

Locations

SpeakerYuri LatushkinDepartment of Mathematics, University of Missourihttp://www.math.missouri.edu/~yuri/ Description Abstract We prove that a first order linear differential operator G=-d/dt+A(t)...