Sciweavers

8486 search results - page 363 / 1698
» Ordered Enumeration Method
Sort
View
JAR
2006
95views more  JAR 2006»
15 years 5 months ago
Mechanizing and Improving Dependency Pairs
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
Jürgen Giesl, René Thiemann, Peter Sch...
RC
2006
87views more  RC 2006»
15 years 5 months ago
Robust Control for Two-Time-Scale Discrete Interval Systems
The problem of designing robust controller for discrete two-time-scale interval systems, conveniently represented using interval matrix notion, is considered. The original full ord...
Balasaheb Patre, Bijnan Bandyopadhyay
PAMI
1998
124views more  PAMI 1998»
15 years 4 months ago
Robust Adaptive Segmentation of Range Images
—We propose a novel image segmentation technique using the robust, adaptive least kth order squares (ALKS) estimator which minimizes the kth order statistics of the squared of re...
Kil-Moo Lee, Peter Meer, Rae-Hong Park
ICIP
2009
IEEE
15 years 2 months ago
Device temporal forensics: An information theoretic approach
By formulating the problem of ordering the outputs observed from a device over time, we pose a new problem in forensics and propose a framework for addressing this problem of devi...
Junwen Mao, Orhan Bulan, Gaurav Sharma, Suprakash ...
HPCA
2009
IEEE
16 years 5 months ago
Fast complete memory consistency verification
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
Yunji Chen, Yi Lv, Weiwu Hu, Tianshi Chen, Haihua ...