Sciweavers

1940 search results - page 255 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
CIKM
1998
Springer
15 years 10 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
15 years 7 months ago
A new quantum behaved particle swarm optimization
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
Millie Pant, Radha Thangaraj, Ajith Abraham
IEAAIE
2010
Springer
15 years 4 months ago
Improving Timetable Quality in Scheduled Transit Networks
This work deals with an original problem with regard to the traditionally sequential planning process in public transit networks. This problem aims at modifying the network's ...
Valérie Guihaire, Jin-Kao Hao
ICCV
2009
IEEE
16 years 11 months ago
Multimodal Partial Estimates Fusion
Fusing partial estimates is a critical and common problem in many computer vision tasks such as part-based detection and tracking. It generally becomes complicated and intractab...
Jiang Xu, Junsong Yuan, YingWu
ICIP
2006
IEEE
16 years 8 months ago
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
Mala L. Radhakrishnan, Sara L. Su