Sciweavers

46 search results - page 7 / 10
» The Elimination Procedure for the Phylogeny Number
Sort
View
VTS
2003
IEEE
119views Hardware» more  VTS 2003»
14 years 24 days ago
Test Data Compression Using Dictionaries with Fixed-Length Indices
—We present a dictionary-based test data compression approach for reducing test data volume and testing time in SOCs. The proposed method is based on the use of a small number of...
Lei Li, Krishnendu Chakrabarty
SASN
2006
ACM
14 years 1 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
CP
1999
Springer
13 years 11 months ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz
ICML
2000
IEEE
14 years 8 months ago
Constructive Feature Learning and the Development of Visual Expertise
We present a framework for learning features for visual discrimination. The learning system is exposed to a sequence of training images. Whenever it fails to recognize a visual co...
Justus H. Piater, Roderic A. Grupen
ICDAR
2005
IEEE
14 years 1 months ago
Fast Vector Matching Methods and Their Applications to Handwriting Recognition
A common practice in pattern recognition is to classify an unknown object by matching its feature vector with all the feature vectors stored in a database. When the number of clas...
Ying-Ho Liu, Wen-Hsiung Lin, Fu Chang, Chin-Chin L...