Sciweavers

18306 search results - page 333 / 3662
» Algorithmics in Exponential Time
Sort
View
JSC
2010
99views more  JSC 2010»
15 years 5 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
AINA
2008
IEEE
16 years 1 months ago
LRTG: Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
We consider scheduling distributed real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node ...
Kai Han, Binoy Ravindran, E. Douglas Jensen
DATE
2005
IEEE
101views Hardware» more  DATE 2005»
16 years 12 days ago
TSUNAMI: An Integrated Timing-Driven Place And Route Research Platform
In this paper, we present an experimental integrated platform for the research, development and evaluation of new VLSI back-end algorithms and design flows. Interconnect scaling ...
Christophe Alexandre, Hugo Clément, Jean-Pa...
192
Voted
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 11 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
WSCG
2003
145views more  WSCG 2003»
15 years 8 months ago
Real-Time Soft Shadows Using a Single Light Sample
We present a real-time rendering algorithm that generates soft shadows of dynamic scenes using a single light sample. As a depth-map algorithm it can handle arbitrary shadowed sur...
Florian Kirsch, Jürgen Döllner