4110 search results - page 283 / 822 » Efficient algorithms for the 2-gathering problem |
194
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
173
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
174
click to vote
GIS
2009
ACM
16 years 7 months ago
2009
ACM
We envision participatory texture documentation (PTD) as a process in which a group of users (dedicated individuals and/or general public) with camera-equipped mobile phones parti...
165
click to vote
ADMA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The issue of maintaining privacy in frequent itemset mining has attracted considerable attentions. In most of those works, only distorted data are available which may bri...
138
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...