Sciweavers

2635 search results - page 252 / 527
» Algorithms for the Database Layout Problem
Sort
View
IAT
2003
IEEE
15 years 12 months ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 10 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
SAC
2006
ACM
16 years 17 days ago
Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or in federated form. Increasingly, privacy and security co...
Hwanjo Yu, Xiaoqian Jiang, Jaideep Vaidya
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
16 years 8 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
ICDE
2001
IEEE
180views Database» more  ICDE 2001»
16 years 8 months ago
Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information
Nearest neighbor (NN) search in high dimensional feature space is widely used for similarity retrieval of multimedia information. However, recent research results in the database ...
Norio Katayama, Shin'ichi Satoh