Sciweavers

820 search results - page 157 / 164
» Inducing Temporal Graphs
Sort
View
COMPGEOM
2005
ACM
13 years 10 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 9 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta
AAAI
1990
13 years 9 months ago
Constructor: A System for the Induction of Probabilistic Models
The probabilistic network technology is a knowledgebased technique which focuses on reasoning under uncertainty. Because of its well defined semantics and solid theoretical founda...
Robert M. Fung, Stuart L. Crawford
GECCO
2008
Springer
107views Optimization» more  GECCO 2008»
13 years 9 months ago
The influence of scaling and assortativity on takeover times in scale-free topologies
In evolving systems, the topological characteristics of population structure have a pronounced impact on the rate of spread of advantageous alleles, and therefore affect selective...
Joshua L. Payne, Margaret J. Eppstein
APPML
2007
154views more  APPML 2007»
13 years 8 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio