- Biblioteca Digitais de Teses e Dissertações da USP
- Elsevier B.V.
- The Brazilian Society of Mechanical Sciences
- Sociedade Brasileira de Química
- World Scientific Publishing Company
- University of Rochester. Computer Science Department.
- Australian Computer Society; Sydney
- Université de Montréal
- Springer Verlag
- Biblioteca Digital da Unicamp
- Universidade Cornell
- Universidade Duke
- Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo
- UNAM, Centro de Ciencias Aplicadas y Desarrollo Tecnológico
- Journal of the South African Institution of Civil Engineering
- Mais Publicadores...

## Estudo do fenômeno da auto-intersecção em um anel anisotrópico; Study of the self-intersection anomaly in an anisotropic ring

## Differential geometry of intersection curves in R(4) of three implicit surfaces

## Algorithm to determine the intersection curves between bezier surfaces by the solution of multivariable polynomial system and the differential marching method

## Local intersection volume (LIV) descriptors: 3D-QSAR models for PGI2 receptor ligands

## The Intersection Complex as a Weight Truncation and an Application to Shimura Varieties

## Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems

_{j}elements of color j, for j = 1, 2, ... , d. Relationships are characterized among the solutions to the family of problems generated when the vector (q

_{1}, q

_{2}, ... , q

_{d}) is allowed to range over all values that sum to n. A fast algorithm is given for solving such matroid intersection problems when d is small. A characterization is presented for how the solution changes when one element changes in cost. Data structures are given for updating the solution on-line each time the cost of an arbitrary matroid element is modified. Efficient update algorithms are given for maintaining a color-constrained minimum spanning tree in either a general or a planar graph. An application of the techniques to finding a minimum spanning tree with several degree-constrained vertices is described.

## Privacy preserving set intersection based on bilinear groups

## Intersection : Exploration du concept à travers la composition de trois oeuvres musicales

## Intersection local times of independent Brownian motions as generalized white noise functionals

## Metodos computacionais para determinação de pontos de intersecção de n esferas no 'R POT. N'; Computacional methods for determination of points of intersection of n sphere in 'R POT. N'

## Intersection Cohomology. Simplicial Blow-up and Rational Homotopy

## Tropical Intersection Theory from Toric Varieties

## Regularity of Intersection Local Times of Fractional Brownian Motions

## Combinatorial Intersection Cohomology for Fans

## On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs

## Toroidality and projective-planarity of intersection graphs of subgroups of finite groups

## Analyzing Stratified Spaces Using Persistent Versions of Intersection and Local Homology

This dissertation places intersection homology and local homology within the framework of persistence, which was originally developed for ordinary homology by Edelsbrunner, Letscher, and Zomorodian. The eventual goal, begun but not completed here, is to provide analytical tools for the study of embedded stratified spaces, as well as for high-dimensional and possibly noisy datasets for which the number of degrees of freedom may vary across the parameter space. Specifically, we create a theory of persistent intersection homology for a filtered stratified space and prove several structural theorems about the pair groups asso- ciated to such a filtration. We prove the correctness of a cubic algorithm which computes these pair groups in a simplicial setting. We also define a series of intersec- tion homology elevation functions for an embedded stratified space and characterize their local maxima in dimension one. In addition, we develop a theory of persistence for a multi-scale analogue of the local homology groups of a stratified space at a point. This takes the form of a series of local homology vineyards which allow one to assess the homological structure within a one-parameter family of neighborhoods of the point. Under the assumption of dense sampling...