Sciweavers

2260 search results - page 44 / 452
» A new algorithm for clustering search results
Sort
View
ICPR
2000
IEEE
14 years 1 days ago
Oscillating Search Algorithms for Feature Selection
A new sub-optimal subset search method for feature selection is introduced. As opposed to other till now known subset selection methods the oscillating search is not dependent on ...
Petr Somol, Pavel Pudil
WWW
2004
ACM
14 years 8 months ago
Affinity rank: a new scheme for efficient web search
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, W...
MST
2010
107views more  MST 2010»
13 years 6 months ago
Fixed-Parameter Algorithms for Cluster Vertex Deletion
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
Falk Hüffner, Christian Komusiewicz, Hannes M...
DEXA
2006
Springer
190views Database» more  DEXA 2006»
13 years 11 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
NETWORKS
2008
13 years 7 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani