Sciweavers

46 search results - page 8 / 10
» Applying Local Search to Temporal Reasoning
Sort
View
92
Voted
BMCBI
2008
139views more  BMCBI 2008»
14 years 10 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu
86
Voted
EWCBR
2006
Springer
15 years 1 months ago
Unsupervised Feature Selection for Text Data
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
Nirmalie Wiratunga, Robert Lothian, Stewart Massie
67
Voted
AAAI
2000
14 years 11 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
65
Voted
AIPS
2006
14 years 11 months ago
Optimal Rectangle Packing: A Meta-CSP Approach
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
Michael D. Moffitt, Martha E. Pollack
ICIP
2004
IEEE
15 years 12 months ago
Robust video signature based on ordinal measure
In this paper we proposed a video signature based on ordinal measure of resampled video frames, which is robust to changing compression formats, compression ratios, frame sizes an...
Xian-Sheng Hua, Xian Chen, HongJiang Zhang