4112 search results - page 207 / 823 » Efficient Algorithms for the Spoonerism 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...
193
click to vote
IANDC
2006
15 years 6 months ago
2006
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
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...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...