Sciweavers

603 search results - page 106 / 121
» DFS-Tree Based Heuristic Search
Sort
View
JCDL
2010
ACM
151views Education» more  JCDL 2010»
13 years 11 months ago
Domain-specific iterative readability computation
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
Jin Zhao, Min-Yen Kan
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
13 years 11 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
13 years 9 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
JIIS
2007
133views more  JIIS 2007»
13 years 9 months ago
SPHINX: Schema integration by example
The Internet has instigated a critical need for automated tools that facilitate integrating countless databases. Since non-technical end users are often the ultimate repositories ...
François Barbançon, Daniel P. Mirank...
SIGIR
2008
ACM
13 years 9 months ago
A study of methods for negative relevance feedback
Negative relevance feedback is a special case of relevance feedback where we do not have any positive example; this often happens when the topic is difficult and the search result...
Xuanhui Wang, Hui Fang, ChengXiang Zhai