Sciweavers

1054 search results - page 140 / 211
» Capacitated Domination Problem
Sort
View
FOCS
2009
IEEE
15 years 6 months ago
(Meta) Kernelization
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshta...
AAAI
2007
15 years 1 months ago
Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
Laurence A. Kramer, Laura Barbulescu, Stephen F. S...
MICCAI
2002
Springer
16 years 3 days ago
Line Integral Convolution for Visualization of Fiber Tract Maps from DTI
Abstract. Diffusion tensor imaging (DTI) can provide the fundamental information required for viewing structural connectivity. However, robust and accurate acquisition and processi...
Tim McGraw, Baba C. Vemuri, Zhizhou Wang, Yunmei C...
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
15 years 11 months ago
Mining favorable facets
The importance of dominance and skyline analysis has been well recognized in multi-criteria decision making applications. Most previous studies assume a fixed order on the attribu...
Raymond Chi-Wing Wong, Jian Pei, Ada Wai-Chee Fu, ...
WWW
2009
ACM
15 years 6 months ago
Network-aware forward caching
This paper proposes and evaluates a Network Aware Forward Caching approach for determining the optimal deployment strategy of forward caches to a network. A key advantage of this ...
Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Ha...