Sciweavers

919 search results - page 54 / 184
» Efficient computation of view subsets
Sort
View
GRC
2007
IEEE
14 years 3 months ago
Towards Mobile Internet: Location Privacy Threats and Granular Computation Challenges
The bulk of contents out on the Internet continue to grow at an astounding pace. As computing and communications become ubiquitous, we are entering the Mobile Internet Computing e...
Ling Liu
COCOON
1998
Springer
14 years 28 days 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 20 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
IDA
2008
Springer
13 years 8 months ago
Estimating the depth of anesthesia using fuzzy soft computation applied to EEG features
Estimating the depth of anesthesia (DOA) is still a challenging area in anesthesia research. The objective of this study was to design a fuzzy rule based system which integrates el...
V. Esmaeili, Amin Assareh, M. B. Shamsollahi, Moha...
CLOUDCOM
2010
Springer
13 years 6 months ago
Efficient Metadata Generation to Enable Interactive Data Discovery over Large-Scale Scientific Data Collections
Discovering the correct dataset efficiently is critical for computations and effective simulations in scientific experiments. In contrast to searching web documents over the Intern...
Sangmi Lee Pallickara, Shrideep Pallickara, Milija...