Sciweavers

3227 search results - page 601 / 646
» Designing with Distance Fields
Sort
View
COCOON
1998
Springer
14 years 1 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
CIKM
2009
Springer
14 years 27 days ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
DASFAA
2004
IEEE
86views Database» more  DASFAA 2004»
14 years 22 days ago
Supporting Exploratory Queries in Databases
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
Abhijit Kadlag, Amol V. Wanjari, Juliana Freire, J...
ECTEL
2006
Springer
14 years 20 days ago
Peer-to-peer Face-to-face Collaboration
In this paper, we present a proof of concept application of a technique that is designed explicitly for face to face collaboration software architectures. The objective is to minim...
Delfina Malandrino, Ilaria Manno
EUC
2006
Springer
14 years 19 days ago
A Reverse AODV Routing Protocol in Ad Hoc Mobile Networks
In mobile ad hoc networks, mobile devices wander autonomously for the use of wireless links and dynamically varying network topology. AODV (Ad-hoc on-demand Distance vector routing...
Chonggun Kim, Elmurod Talipov, Byoungchul Ahn