Sciweavers

232 search results - page 29 / 47
» Fast High-Dimensional Data Search in Incomplete Databases
Sort
View
EDBT
2006
ACM
154views Database» more  EDBT 2006»
15 years 5 months ago
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
Christoph Brochhaus, Marc Wichterich, Thomas Seidl
ELPUB
1998
ACM
15 years 5 months ago
Research Information Take Away or How to Serve Research Information Fast and Friendly on the Web
In 1997 the library department at the University of Karlskrona/Ronneby was asked to develop a database which could be used to collate and present all the research material and ong...
Peter Linde, Leif Lagebrand
ICPR
2006
IEEE
15 years 7 months ago
Fast Feature Extraction Approach for Multi-Dimension Feature Space Problems
Recently, we proposed a fast feature extraction approach denoted FSOM utilizes Self Organizing Map (SOM). FSOM [1] overcomes the slowness of traditional SOM search algorithm. We i...
Alaa El. Sagheer, Naoyuki Tsuruta, Rin-ichiro Tani...
CIKM
2009
Springer
15 years 8 months ago
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos ...
IEEECGIV
2006
IEEE
15 years 7 months ago
PathBank: Web-Based Querying and Visualziation of an Integrated Biological Pathway Database
PathBank is a web-based query and visualization system for biological pathways using an integrated pathway database. To address the needs for biologists to visualize and analyze b...
Joshua Wing Kei Ho, Tristan Manwaring, Seok-Hee Ho...