( en | de | ru )

 

Disambiguation of "Furuse, Kazutaka"

Author of the publication

copydeleteadd this publication to your clipboard
FBDA: A Filtering Mechanism Based on Distance Approximation.

, , , , and . DASFAA, page 162-163. IEEE Computer Society, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Furuse, Kazutaka
add a person with the name Furuse, Kazutaka
 

Other publications of authors with the same name

Supporting Web Search with Near Keywords., , , and . FSKD (2), page 411-415. IEEE Computer Society, (2007)0-7695-2874-0.Balanced Nearest Neighborhood Query in Spatial Database., , , and . BigComp, page 1-4. IEEE, (2019)MB+Tree: A Dynamically Updatable Metric Index for Similarity Searches., , , , and . Web-Age Information Management, volume 1846 of Lecture Notes in Computer Science, page 356-373. Springer, (2000)Efficient Methods in Finding Aggregate Nearest Neighbor by Projection-Based Filtering., , , and . ICCSA (3), volume 4707 of Lecture Notes in Computer Science, page 821-833. Springer, (2007)An Efficient Algorithm for Arbitrary Reverse Furthest Neighbor Queries., , , and . APWeb, volume 7235 of Lecture Notes in Computer Science, page 60-72. Springer, (2012)Improving Collaborative Filtering by W-clustering., , , and . Databases and Applications, page 81-86. IASTED/ACTA Press, (2004)Efficient Bounds in Finding Aggregate Nearest Neighbors., , , and . DEXA, volume 5181 of Lecture Notes in Computer Science, page 693-700. Springer, (2008)Implementation and Performance Evaluation of Compressed Bit-Sliced Signature Files., , and . CISMOD, volume 1006 of Lecture Notes in Computer Science, page 164-177. Springer, (1995)Grid-Index Algorithm for Reverse Rank Queries., , , , and . EDBT, page 306-317. OpenProceedings.org, (2017)Focused crawling by exploiting anchor text using decision tree., , and . WWW (Special interest tracks and posters), page 1190-1191. ACM, (2005)