Sciweavers

1099 search results - page 85 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
BIRTHDAY
2010
Springer
15 years 2 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
RT
2001
Springer
15 years 2 months ago
Interactive Sampling and Rendering for Complex and Procedural Geometry
We present a new sampling method for procedural and complex geometries, which allows interactive point-based modeling and rendering of such scenes. For a variety of scenes, object-...
Marc Stamminger, George Drettakis
BMCBI
2008
144views more  BMCBI 2008»
14 years 10 months ago
Local conservation scores without a priori assumptions on neutral substitution rates
Background: Comparative genomics aims to detect signals of evolutionary conservation as an indicator of functional constraint. Surprisingly, results of the ENCODE project revealed...
Janis Dingel, Pavol Hanus, Niccolò Leonardi...
BROADNETS
2006
IEEE
15 years 4 months ago
Complexity of Converter Placement Supporting Broadcast in WDM Networks
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...
Rudra Dutta, Prashant Iyer, Carla D. Savage
JAIR
2011
123views more  JAIR 2011»
14 years 4 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...