Sciweavers

493 search results - page 65 / 99
» Representing preferences using intervals
Sort
View
ISPASS
2008
IEEE
14 years 2 months ago
Program Phase Detection based on Critical Basic Block Transitions
Many programs go through phases as they execute. Knowing where these phases begin and end can be beneficial. For example, adaptive architectures can exploit such information to lo...
Paruj Ratanaworabhan, Martin Burtscher
KAIS
2008
119views more  KAIS 2008»
13 years 7 months ago
An information-theoretic approach to quantitative association rule mining
Abstract. Quantitative Association Rule (QAR) mining has been recognized an influential research problem over the last decade due to the popularity of quantitative databases and th...
Yiping Ke, James Cheng, Wilfred Ng
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
CN
2004
110views more  CN 2004»
13 years 7 months ago
TCP and UDP performance for Internet over optical packet-switched networks
A strong candidate for the future Internet core is optical packet-switched (OPS) network. In this paper, we study the impact of mechanisms as employed in OPS networks on the perfo...
Jingyi He, S.-H. Gary Chan
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 2 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...