Sciweavers

2260 search results - page 113 / 452
» A new algorithm for clustering search results
Sort
View
JCDL
2003
ACM
152views Education» more  JCDL 2003»
15 years 11 months ago
eBizSearch: An OAI-Compliant Digital Library for eBusiness
Niche Search Engines offer an efficient alternative to traditional search engines when the results returned by general-purpose search engines do not provide a sufficient degree of...
Yves Petinot, Pradeep B. Teregowda, Hui Han, C. Le...
CIKM
2010
Springer
15 years 4 months ago
A unified optimization framework for robust pseudo-relevance feedback algorithms
We present a flexible new optimization framework for finding effective, reliable pseudo-relevance feedback models that unifies existing complementary approaches in a principled wa...
Joshua V. Dillon, Kevyn Collins-Thompson
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
16 years 3 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou
IMECS
2007
15 years 7 months ago
Metamodel-Assisted Global Search Using a Probing Technique
—This paper presents a new metamodel-assisted metaheuristic algorithm for optimisation problems involving computationally expensive simulations. The algorithm, called Global Prob...
Anna Persson, Henrik Grimm, Amos Ng
DAM
2007
94views more  DAM 2007»
15 years 6 months ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...