We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
: Due to the ever increasing impacts of globalization, people will/have to work on data which is distributed all around the world [LKK+ 97]. Query processing on the corresponding d...
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
Many Internet-based applications have adopted XML as the standard data exchange format. These XML data are typically stored in its native form, thus creating the need to present XM...
A content-based retrieval model for tackling the mismatch problems specific to music data is proposed and implemented. The system uses a pitch profile encoding for queries in any ...