Sciweavers

2498 search results - page 304 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
15 years 4 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
JMLR
2010
157views more  JMLR 2010»
15 years 1 months ago
Combining Experiments to Discover Linear Cyclic Models with Latent Variables
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relatio...
Frederick Eberhardt, Patrik O. Hoyer, Richard Sche...
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
14 years 9 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
CORR
2012
Springer
272views Education» more  CORR 2012»
14 years 2 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
ICS
2004
Tsinghua U.
15 years 12 months ago
Scaling the issue window with look-ahead latency prediction
In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide ...
Yongxiang Liu, Anahita Shayesteh, Gokhan Memik, Gl...