This book constitutes the refereed proceedings of the Chinese Conference on Pattern Recognition, CCPR 2012, held in Beijing, China, in September 2012. The 82 revised full papers presented were carefully reviewed and selected from 137 submissions. The papers are organized in topical sections on pattern recognition theory; computer vision; biometric recognition; medical imaging; image and video analysis; document analysis; speech processing; natural language processing and information retrieval.

This book consitutes the proceedings of the Third Annual European Symposium on Algorithms, ESA '95, held in Corfu, Greece in September 1995. The volume presents 42 full revised papers selected during a careful refereeing process from a total of 119 submissions; in addition, there is a prominent keynote address. This year, the scope has been further expanded to new areas of computational endeavour in science; the book covers many aspects of algorithms research and application ranging from combinatorial mathematics to hardware design.

Located in the geographical center of Berlin, the neighboring boroughs of Friedrichshain and Kreuzberg shared a history and identity until their fortunes diverged dramatically following the construction of the Berlin Wall, which placed them within opposing political systems. This revealing account of the two municipal districts before, during and after the Cold War takes a microhistorical approach to investigate the broader historical trajectories of East and West Berlin, with particular attention to housing, religion, and leisure. Merged in 2001, they now comprise a single neighborhood that bears the traces of these complex histories and serves as an illuminating case study of urban renewal, gentrification, and other social processes that continue to reshape Berlin.

Geometric group theory is the study of the interplay between groups and the spaces they act on, and has its roots in the works of Henri Poincaré, Felix Klein, J.H.C. Whitehead, and Max Dehn. Office Hours with a Geometric Group Theorist brings together leading experts who provide one-on-one instruction on key topics in this exciting and relatively new field of mathematics. It's like having office hours with your most trusted math professors. An essential primer for undergraduates making the leap to graduate work, the book begins with free groups—actions of free groups on trees, algorithmic questions about free groups, the ping-pong lemma, and automorphisms of free groups. It goes on to cover several large-scale geometric invariants of groups, including quasi-isometry groups, Dehn functions, Gromov hyperbolicity, and asymptotic dimension. It also delves into important examples of groups, such as Coxeter groups, Thompson's groups, right-angled Artin groups, lamplighter groups, mapping class groups, and braid groups. The tone is conversational throughout, and the instruction is driven by examples. Accessible to students who have taken a first course in abstract algebra, Office Hours with a Geometric Group Theorist also features numerous exercises and in-depth projects designed to engage readers and provide jumping-off points for research projects.

Now available in an affordable softcover edition, this classic in Springer's acclaimed Virtual Laboratory series is the first comprehensive account of the computer simulation of plant development. 150 illustrations, one third of them in colour, vividly demonstrate the spectacular results of the algorithms used to model plant shapes and developmental processes. The latest in computer-generated images allow us to look at plants growing, self-replicating, responding to external factors and even mutating, without becoming entangled in the underlying mathematical formulae involved. The authors place particular emphasis on Lindenmayer systems - a notion conceived by one of the authors, Aristid Lindenmayer, and internationally recognised for its exceptional elegance in modelling biological phenomena. Nonetheless, the two authors take great care to present a survey of alternative methods for plant modelling.