Sciweavers

1298 search results - page 117 / 260
» The online set cover problem
Sort
View
APBC
2004
132views Bioinformatics» more  APBC 2004»
15 years 7 months ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
STACS
1999
Springer
15 years 10 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
JCDL
2005
ACM
95views Education» more  JCDL 2005»
16 years 1 days ago
Resolving the unencoded character problem for chinese digital libraries
Constructing a Chinese digital library, especially for a historical article archiving, is often bothered by the small character sets supported by the current computer systems. Thi...
Derming Juang, Jenq-Haur Wang, Chen-Yu Lai, Ching-...
WWW
2002
ACM
16 years 7 months ago
Accelerated focused crawling through online relevance feedback
The organization of HTML into a tag tree structure, which is rendered by browsers as roughly rectangular regions with embedded text and HREF links, greatly helps surfers locate an...
Soumen Chakrabarti, Kunal Punera, Mallela Subraman...
IBPRIA
2009
Springer
15 years 11 months ago
Large Scale Online Learning of Image Similarity through Ranking
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...
Gal Chechik, Varun Sharma, Uri Shalit, Samy Bengio