Sciweavers

334 search results - page 32 / 67
» Efficient Algorithms for the Tree Homeomorphism Problem
Sort
View
WWW
2006
ACM
14 years 9 months ago
Browsing on small screens: recasting web-page segmentation into an efficient machine learning framework
Fitting enough information from webpages to make browsing on small screens compelling is a challenging task. One approach is to present the user with a thumbnail image of the full...
Shumeet Baluja
WAE
2001
281views Algorithms» more  WAE 2001»
13 years 9 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
FOCS
1999
IEEE
14 years 23 days ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
JMM2
2008
124views more  JMM2 2008»
13 years 8 months ago
Integrated Feature Selection and Clustering for Taxonomic Problems within Fish Species Complexes
As computer and database technologies advance rapidly, biologists all over the world can share biologically meaningful data from images of specimens and use the data to classify th...
Huimin Chen, Henry L. Bart Jr., Shuqing Huang
DIS
2007
Springer
14 years 12 days ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono