Sciweavers

7106 search results - page 1420 / 1422
» Restricted Complexity, General Complexity
Sort
View
WWW
2009
ACM
14 years 8 months ago
Incorporating site-level knowledge to extract structured data from web forums
Web forums have become an important data resource for many web applications, but extracting structured data from unstructured web forum pages is still a challenging task due to bo...
Jiang-Ming Yang, Rui Cai, Yida Wang, Jun Zhu, Lei ...
PODC
2009
ACM
14 years 8 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 8 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
BMCBI
2007
156views more  BMCBI 2007»
13 years 7 months ago
Predictive modeling of plant messenger RNA polyadenylation sites
Background: One of the essential processing events during pre-mRNA maturation is the posttranscriptional addition of a polyadenine [poly(A)] tail. The 3'-end poly(A) track pr...
Guoli Ji, Jianti Zheng, Yingjia Shen, Xiaohui Wu, ...
ANCS
2009
ACM
13 years 5 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
« Prev « First page 1420 / 1422 Last » Next »