Sciweavers

10051 search results - page 226 / 2011
» A Dynamic Separator Algorithm
Sort
View
ADMA
2005
Springer
119views Data Mining» more  ADMA 2005»
15 years 12 months ago
Heuristic Scheduling of Concurrent Data Mining Queries
Execution cost of batched data mining queries can be reduced by integrating their I/O steps. Due to memory limitations, not all data mining queries in a batch can be executed toget...
Marek Wojciechowski, Maciej Zakrzewicz
STOC
1993
ACM
179views Algorithms» more  STOC 1993»
15 years 10 months ago
The network inhibition problem
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
Cynthia A. Phillips
CGF
2005
106views more  CGF 2005»
15 years 6 months ago
Hierarchical Penumbra Casting
We present a novel algorithm for rendering physically-based soft shadows in complex scenes. Instead of casting shadow rays, we place both the points to be shaded and the samples o...
Samuli Laine, Timo Aila
STOC
2003
ACM
72views Algorithms» more  STOC 2003»
16 years 6 months ago
OPT versus LOAD in dynamic storage allocation
Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyo...
158
Voted
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
15 years 10 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk