2070 search results - page 147 / 414 » Regret-Minimizing Representative Databases |
145
click to vote
DEXAW
2007
IEEE
15 years 9 months ago
2007
IEEE
Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed a...
107
Voted
ICDE
2007
IEEE
15 years 9 months ago
2007
IEEE
Ontologies have been shown to be beneficial for representing domain knowledge, and are quickly becoming the backbone of the Semantic Web. The need for ontology ranking techniques ...
125
click to vote
ICDE
2007
IEEE
15 years 9 months ago
2007
IEEE
The ability to query data streams is of increasing importance and has been identified as a crucial element for modern organizations and agencies. This paper identifies a class o...
104
click to vote
ICDE
2007
IEEE
15 years 9 months ago
2007
IEEE
Most recommender systems present recommended products in lists to the user. By doing so, much information is lost about the mutual similarity between recommended products. We prop...
123
click to vote
IDEAS
2007
IEEE
15 years 9 months ago
2007
IEEE
The transversal hypergraph enumeration based algorithms can be efficient in mining frequent itemsets, however it is difficult to apply them to sequence mining problems. In this ...