4850 search results - page 247 / 970 » Approximate Data Structures with Applications |
261
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
175
Voted
JELIA
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
195
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
197
click to vote
DKE
2006
15 years 6 months ago
2006
Recently, there is an increasing research efforts in XML data mining. These research efforts largely assumed that XML documents are static. However, in reality, the documents are ...
168
click to vote
AAAI
2000
15 years 8 months ago
2000
Spatio-temporal data sets arise when time-varying physical fields are discretized for simulation or analysis. Examples of time-varying fields are isothermal regions in the sea or ...