Sciweavers

101 search results - page 17 / 21
» Domination Problems in Nowhere-Dense Classes
Sort
View
AAAI
2007
13 years 9 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...
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
14 years 7 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, ...
COMCOM
2004
108views more  COMCOM 2004»
13 years 7 months ago
Dynamic establishment of differentiated survivable lightpaths in WDM mesh networks
In the emerging next-generation transport networks, called intelligent optical transport networks, DWDM-based optical components like add-drop multiplexers and optical cross conne...
Chava Vijaya Saradhi, C. Siva Ram Murthy
ICDT
2005
ACM
88views Database» more  ICDT 2005»
14 years 26 days ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...