Sciweavers

611 search results - page 68 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
CIKM
2008
Springer
14 years 3 days ago
Answering general time sensitive queries
Time is an important dimension of relevance for a large number of searches, such as over blogs and news archives. So far, research on searching over such collections has largely f...
Wisam Dakka, Luis Gravano, Panagiotis G. Ipeirotis
ACTA
2006
104views more  ACTA 2006»
13 years 10 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
BMCBI
2006
195views more  BMCBI 2006»
13 years 10 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
14 years 2 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 4 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...