Sciweavers

2125 search results - page 348 / 425
» On Graph Complexity
Sort
View
DAC
2003
ACM
14 years 11 months ago
Accurate timing analysis by modeling caches, speculation and their interaction
Schedulability analysis of real-time embedded systems requires worst case timing guarantees of embedded software performance. This involves not only language level program analysi...
Xianfeng Li, Tulika Mitra, Abhik Roychoudhury
ICML
2007
IEEE
14 years 10 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
ICML
2006
IEEE
14 years 10 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 10 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
WWW
2008
ACM
14 years 10 months ago
Personalized view-based search and visualization as a means for deep/semantic web data access
Effective access to and navigation in information stored in deep Web ontological repositories or relational databases has yet to be realized due to issues with usability of user i...
Mária Bieliková, Michal Tvarozek