Sciweavers

2969 search results - page 142 / 594
» A space efficient algorithm for group structure computation
Sort
View
146
Voted
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 3 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
WWW
2004
ACM
16 years 4 months ago
Efficient web change monitoring with page digest
The Internet and the World Wide Web have enabled a publishing explosion of useful online information, which has produced the unfortunate side effect of information overload: it is...
David Buttler, Daniel Rocco, Ling Liu
114
Voted
JUCS
2008
185views more  JUCS 2008»
15 years 3 months ago
Recognising Informative Web Page Blocks Using Visual Segmentation for Efficient Information Extraction
Abstract: As web sites are getting more complicated, the construction of web information extraction systems becomes more troublesome and time-consuming. A common theme is the diffi...
Jinbeom Kang, Joongmin Choi
122
Voted
ECCV
2008
Springer
16 years 5 months ago
Extracting Moving People from Internet Videos
Abstract. We propose a fully automatic framework to detect and extract arbitrary human motion volumes from real-world videos collected from YouTube. Our system is composed of two s...
Juan Carlos Niebles, Bohyung Han, Andras Ferencz, ...
JCB
2006
115views more  JCB 2006»
15 years 3 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger