Sciweavers

4095 search results - page 424 / 819
» How to test a tree
Sort
View
KDD
2002
ACM
194views Data Mining» more  KDD 2002»
16 years 6 months ago
Scale Space Exploration For Mining Image Information Content
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
Mariana Ciucu, Patrick Héas, Mihai Datcu, J...
ICDE
2010
IEEE
263views Database» more  ICDE 2010»
16 years 5 months ago
Managing Uncertainty of XML Schema Matching
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
Reynold Cheng, Jian Gong, David W. Cheung
MOBIHOC
2005
ACM
16 years 5 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
CIKM
2009
Springer
16 years 21 days ago
Structure-aware indexing for keyword search in databases
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
Guoliang Li, Jianhua Feng, Jianyong Wang
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 11 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...