Sciweavers

567 search results - page 84 / 114
» Decomposing replicable functions
Sort
View
TPLP
2008
89views more  TPLP 2008»
13 years 8 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
TSP
2008
143views more  TSP 2008»
13 years 8 months ago
Sparse Representation in Structured Dictionaries With Application to Synthetic Aperture Radar
Sparse signal representations and approximations from overcomplete dictionaries have become an invaluable tool recently. In this paper, we develop a new, heuristic, graph-structure...
Kush R. Varshney, Müjdat Çetin, John W...
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
13 years 8 months ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec
TSMC
2002
102views more  TSMC 2002»
13 years 8 months ago
Modeling and analysis of air campaign resource allocation: a spatio-temporal decomposition approach
In this paper, we address the modeling and analysis issues associated with a generic theater level campaign where two adversaries pit their military resources against each other ov...
Debasish Ghose, M. Krichman, Jason L. Speyer, Jeff...
PAMI
2010
396views more  PAMI 2010»
13 years 7 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu