Sciweavers

1963 search results - page 261 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
CIKM
2005
Springer
14 years 2 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
TKDE
2008
136views more  TKDE 2008»
13 years 8 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng
TON
2010
221views more  TON 2010»
13 years 3 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
SBACPAD
2008
IEEE
126views Hardware» more  SBACPAD 2008»
14 years 3 months ago
A Software Transactional Memory System for an Asymmetric Processor Architecture
Due to the advent of multi-core processors and the consequent need for better concurrent programming abstractions, new synchronization paradigms have emerged. A promising one, kno...
Felipe Goldstein, Alexandro Baldassin, Paulo Cento...
IPPS
2005
IEEE
14 years 2 months ago
Exploring the Energy-Time Tradeoff in High-Performance Computing
High-performance computing is and has always been performance oriented. However, a consequence of the push towards maximum performance is increased energy consumption, especially ...
Feng Pan, Vincent W. Freeh, Daniel M. Smith