Sciweavers

205 search results - page 29 / 41
» Testing the Equivalence of Regular Languages
Sort
View
EMNLP
2010
14 years 7 months ago
Predicting the Semantic Compositionality of Prefix Verbs
In many applications, replacing a complex word form by its stem can reduce sparsity, revealing connections in the data that would not otherwise be apparent. In this paper, we focu...
Shane Bergsma, Aditya Bhargava, Hua He, Grzegorz K...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
15 years 9 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
MVA
2000
172views Computer Vision» more  MVA 2000»
14 years 10 months ago
Partial Face Extraction and Recognition Using Radial Basis Function Networks
work, applies a nonlinear transformation from the input space to the hidden space. The output layer Partial face images, e.g.1 eyes, nose, and ear supplies the response of the netw...
Nan He, Kiminori Sato, Yukitoshi Takahashi
DATE
2008
IEEE
124views Hardware» more  DATE 2008»
15 years 3 months ago
Automated Testability Enhancements for Logic Brick Libraries
Circuit fabrics composed of highly regular structures, called logic bricks, have been described recently for improving yield. An automated logic brick design flow based on a SAT ...
Jason G. Brown, Brian Taylor, Ronald D. Blanton, L...
JMIV
2007
99views more  JMIV 2007»
14 years 9 months ago
Image Similarity Based on Intensity Scaling
An image similarity measure based upon intensity scaling is investigated for the registration of images which differ in contast. The measure is introduced for both optical flow a...
Stephen L. Keeling