|
Search the dblp DataBase
Kazutaka Furuse:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jiyuan An, Hanxiong Chen, Kazutaka Furuse, Masahiro Ishikawa, Nobuo Ohbo
The Complex Polyhedra Technique: An Index Structure for High-Dimensional Space. [Citation Graph (0, 0)][DBLP] Australasian Database Conference, 2002, pp:- [Conf]
- Kazutaka Furuse, Jeffrey Xu Yu, Kazunori Yamaguchi, Hiroyuki Kitagawa, Nobuo Ohbo
A Guideline for Implementing Access Method Modules in Extensible DBMS MODUS. [Citation Graph (0, 0)][DBLP] Australian Database Conference, 1993, pp:39-54 [Conf]
- Chaoyuan Cui, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo
Web Query Refinement without Information Loss. [Citation Graph (0, 0)][DBLP] APWeb, 2004, pp:363-372 [Conf]
- Kazutaka Furuse, Kazushige Asada, Atsushi Iizawa
Implementation and Performance Evaluation of Compressed Bit-Sliced Signature Files. [Citation Graph (0, 0)][DBLP] CISMOD, 1995, pp:164-177 [Conf]
- Kazutaka Furuse, Kazunori Yamaguchi, Hiroyuki Kitagawa, Nobuo Ohbo
Abstract Indexing Mechanism of the Extensible DBMS Modus. [Citation Graph (0, 21)][DBLP] DASFAA, 1993, pp:189-196 [Conf]
- Xiaowei Kan, T. Ohwada, Kazushige Asada, Atsushi Iizawa, Kazutaka Furuse
FBDA: A Filtering Mechanism Based on Distance Approximation. [Citation Graph (0, 0)][DBLP] DASFAA, 2001, pp:162-163 [Conf]
- Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo, Seiichi Nishihara
Improving Collaborative Filtering by W-clustering. [Citation Graph (0, 0)][DBLP] Databases and Applications, 2004, pp:81-86 [Conf]
- Chaoyuan Cui, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo
Adaptive Query Refinement Based on Global and Local Analysis. [Citation Graph (0, 0)][DBLP] FSKD (1), 2005, pp:584-593 [Conf]
- Jiyuan An, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo, Eamonn J. Keogh
Grid-Based Indexing for Large Time Series Databases. [Citation Graph (0, 0)][DBLP] IDEAL, 2003, pp:614-621 [Conf]
- Xiaowei Kan, Kazushige Asada, Atsushi Iizawa, Kazutaka Furuse
2DS: A Two-dimensional Scheduling Scheme for Data Broadcast. [Citation Graph (0, 0)][DBLP] ISDB, 2002, pp:110-115 [Conf]
- Masahiro Ishikawa, Yi Liu, Kazutaka Furuse, Hanxiong Chen, Nobuo Ohbo
MST Construction with Metric Matrix for Clustering. [Citation Graph (0, 0)][DBLP] VDB, 2000, pp:329-0 [Conf]
- Hanxiong Chen, Jiyuan An, Kazutaka Furuse, Nobuo Ohbo
C2VA: Trim High Dimensional Indexes. [Citation Graph (0, 0)][DBLP] WAIM, 2002, pp:303-315 [Conf]
- Masahiro Ishikawa, Hanxiong Chen, Kazutaka Furuse, Jeffrey Xu Yu, Nobuo Ohbo
MB+Tree: A Dynamically Updatable Metric Index for Similarity Searches. [Citation Graph (0, 0)][DBLP] Web-Age Information Management, 2000, pp:356-373 [Conf]
- Hanxiong Chen, Jeffrey Xu Yu, Kazutaka Furuse, Nobuo Ohbo
Support IR Query Refinement by Partial Keyword Set. [Citation Graph (0, 0)][DBLP] WISE (1), 2001, pp:245-253 [Conf]
- Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
Focused crawling by exploiting anchor text using decision tree. [Citation Graph (0, 0)][DBLP] WWW (Special interest tracks and posters), 2005, pp:1190-1191 [Conf]
- Jiyuan An, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo
CVA file: an index structure for high-dimensional datasets. [Citation Graph (0, 0)][DBLP] Knowl. Inf. Syst., 2005, v:7, n:3, pp:337-357 [Journal]
- Yanmin Luo, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo
Efficient Methods in Finding Aggregate Nearest Neighbor by Projection-Based Filtering. [Citation Graph (0, 0)][DBLP] ICCSA (3), 2007, pp:821-833 [Conf]
Indexing the Function: An Efficient Algorithm for Multi-dimensional Search with Expensive Distance Functions. [Citation Graph (, )][DBLP]
Efficient Bounds in Finding Aggregate Nearest Neighbors. [Citation Graph (, )][DBLP]
Extracting Related Words from Anchor Text Clusters by Focusing on the Page Designer's Intention. [Citation Graph (, )][DBLP]
An Efficient Algorithm for Reverse Furthest Neighbors Query with Metric Index. [Citation Graph (, )][DBLP]
Supporting Web Search with Near Keywords. [Citation Graph (, )][DBLP]
Finding aggregate nearest neighbor efficiently without indexing. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs
|