Sciweavers

163 search results - page 14 / 33
» Improving the Context-sensitive Dependency Graph
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
ICDM
2008
IEEE
92views Data Mining» more  ICDM 2008»
14 years 1 months ago
A Shrinkage Approach for Modeling Non-stationary Relational Autocorrelation
Recent research has shown that collective classification in relational data often exhibit significant performance gains over conventional approaches that classify instances indi...
Pelin Angin, Jennifer Neville
ALGOSENSORS
2009
Springer
13 years 10 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
ISPASS
2006
IEEE
14 years 1 months ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...
ICPP
1996
IEEE
13 years 11 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...