Sciweavers

1403 search results - page 150 / 281
» Set cover algorithms for very large datasets
Sort
View
ICMLA
2008
15 years 7 months ago
Graph-Based Multilevel Dimensionality Reduction with Applications to Eigenfaces and Latent Semantic Indexing
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
Sophia Sakellaridi, Haw-ren Fang, Yousef Saad
IJCAI
2001
15 years 7 months ago
Efficient Consequence Finding
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
Laurent Simon, Alvaro del Val
PAMI
2008
250views more  PAMI 2008»
15 years 6 months ago
Combined Top-Down/Bottom-Up Segmentation
We construct an image segmentation scheme that combines top-down (TD) with bottom-up (BU) processing. In the proposed scheme, segmentation and recognition are intertwined rather th...
Eran Borenstein, Shimon Ullman
ICCAD
1992
IEEE
148views Hardware» more  ICCAD 1992»
15 years 10 months ago
McPOWER: a Monte Carlo approach to power estimation
Excessive power dissipation in integrated circuits causes overheating and can lead to soft errors and or permanent damage. The severity of the problem increases in proportion to t...
Richard Burch, Farid N. Najm, Ping Yang, Timothy N...
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis