Sciweavers

829 search results - page 123 / 166
» Bandit Algorithms for Tree Search
Sort
View
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
15 years 11 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
WWW
2009
ACM
15 years 10 months ago
Quicklink selection for navigational query results
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
HSNMC
2004
Springer
125views Multimedia» more  HSNMC 2004»
15 years 3 months ago
A Pull-Based Approach for a VoD Service in P2P Networks
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
Anwar Al Hamra, Ernst W. Biersack, Guillaume Urvoy...
BMCBI
2008
138views more  BMCBI 2008»
14 years 9 months ago
Methods for simultaneously identifying coherent local clusters with smooth global patterns in gene expression profiles
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
Yin-Jing Tien, Yun-Shien Lee, Han-Ming Wu, Chun-Ho...
IJCAI
2001
14 years 11 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti