5221 search results - page 277 / 1045 » An On-line Problem Database |
154
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
A schema mapping produces a semantic correspondence between two schemas. Automating schema mapping is challenging. The existence of 1:n (or n:1) and n:m mapping cardinalities make...
204
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...
136
click to vote
DASFAA
2007
IEEE
16 years 29 days ago
2007
IEEE
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
170
click to vote
IDEAS
2007
IEEE
16 years 28 days ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
164
click to vote
IDEAS
2007
IEEE
16 years 28 days 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 ...