Sciweavers

2681 search results - page 320 / 537
» Problem F
Sort
View
SIGIR
2010
ACM
15 years 10 months ago
Prototype hierarchy based clustering for the categorization and navigation of web collections
This paper presents a novel prototype hierarchy based clustering (PHC) framework for the organization of web collections. It solves simultaneously the problem of categorizing web ...
Zhaoyan Ming, Kai Wang, Tat-Seng Chua
GECCO
2007
Springer
147views Optimization» more  GECCO 2007»
15 years 10 months ago
A comparison of evaluation methods in coevolution
In this research, we compare four different evaluation methods in coevolution on the Majority Function problem. The size of the problem is selected such that an evaluation against...
Ting-Shuo Yo, Edwin D. de Jong
ACSC
2004
IEEE
15 years 10 months ago
Tuning the Collision Test for Power
The collision test is an important statistical test for rejecting poor random number generators. The test simulates the throwing of balls randomly into urns. A problem in applying...
Wai Wan Tsang, Lucas Chi Kwong Hui, K. P. Chow, C....
CCGRID
2006
IEEE
15 years 10 months ago
Building Cyberinfrastructure for Bioinformatics Using Service Oriented Architecture
-- Cyberinfrastructure makes the development and deployment of bioinformatics applications easier by providing the framework and components that may be loosely coupled using servic...
Wilfred W. Li, Sriram Krishnan, Kurt Mueller, Kohe...
FOCS
2004
IEEE
15 years 10 months ago
Edge-Disjoint Paths in Planar Graphs
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd