Sciweavers

1951 search results - page 343 / 391
» An algorithm for improving graph partitions
Sort
View
RTSS
2005
IEEE
15 years 3 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson
BMCBI
2004
208views more  BMCBI 2004»
14 years 10 months ago
Hybrid clustering for microarray image analysis combining intensity and shape features
Background: Image analysis is the first crucial step to obtain reliable results from microarray experiments. First, areas in the image belonging to single spots have to be identif...
Jörg Rahnenführer, Daniel Bozinov
72
Voted
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
15 years 10 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
SC
2009
ACM
15 years 4 months ago
Enabling high-fidelity neutron transport simulations on petascale architectures
The UNIC code is being developed as part of the DOE’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. UNIC is an unstructured, deterministic neutron transport c...
Dinesh K. Kaushik, Micheal Smith, Allan Wollaber, ...
GMP
2008
IEEE
161views Solid Modeling» more  GMP 2008»
15 years 4 months ago
Slit Map: Conformal Parameterization for Multiply Connected Surfaces
Surface parameterization is a fundamental tool in geometric modeling and processing. Most existing methods deal with simply connected disks. This work introduces a novel method to ...
Xiaotian Yin, Junfei Dai, Shing-Tung Yau, Xianfeng...