Sciweavers

106 search results - page 3 / 22
» Two Element Unavoidable Sets of Partial Words
Sort
View
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
14 years 5 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
NLPRS
2001
Springer
13 years 9 months ago
An Empirical Study of Feature Set Selection for Text Chunking
This paper presents an empirical study for improving the performance of text chunking. We focus on two issues: the problem of selecting feature spaces, and the problem of alleviat...
Young-Sook Hwang, Yong-Jae Kwak, Hoo-Jung Chung, S...
ICCAD
1996
IEEE
121views Hardware» more  ICCAD 1996»
13 years 9 months ago
Identification of unsettable flip-flops for partial scan and faster ATPG
State justification is a time-consuming operation in test generation for sequential circuits. In this paper, we present a technique to rapidly identify state elements (flip-flops)...
Ismed Hartanto, Vamsi Boppana, W. Kent Fuchs
ORDER
2006
154views more  ORDER 2006»
13 years 5 months ago
A Bipartite Analogue of Dilworth's Theorem
Let r be a fixed positive integer. It is shown that, given any partial orders >1, . . ., >r on the same n-element set P, there exist disjoint subsets A, B P, each with at l...
Jacob Fox
BMCBI
2006
129views more  BMCBI 2006»
13 years 5 months ago
BIPAD: A web server for modeling bipartite sequence elements
Background: Many dimeric protein complexes bind cooperatively to families of bipartite nucleic acid sequence elements, which consist of pairs of conserved half-site sequences sepa...
Chengpeng Bi, Peter K. Rogan