Sciweavers

1983 search results - page 327 / 397
» Competitive graph searches
Sort
View
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
14 years 2 days ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
SIGGRAPH
1997
ACM
13 years 12 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
COMPGEOM
2005
ACM
13 years 9 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
BMCBI
2008
173views more  BMCBI 2008»
13 years 8 months ago
Extraction of semantic biomedical relations from text using conditional random fields
Background: The increasing amount of published literature in biomedicine represents an immense source of knowledge, which can only efficiently be accessed by a new generation of a...
Markus Bundschus, Mathäus Dejori, Martin Stet...
BMCBI
2008
228views more  BMCBI 2008»
13 years 8 months ago
Adaptive diffusion kernel learning from biological networks for protein function prediction
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
Liang Sun, Shuiwang Ji, Jieping Ye