Sciweavers

4797 search results - page 36 / 960
» The complexity of partition tasks
Sort
View
CVPR
2009
IEEE
1298views Computer Vision» more  CVPR 2009»
15 years 4 months ago
Video Object Segmentation by Hypergraph Cut
In this paper, we present a new framework of video object segmentation, in which we formulate the task of extracting prominent objects from a scene as the problem of hypergraph ...
Dimitris N. Metaxas, Qingshan Liu, Yuchi Huang
AAAI
2008
13 years 11 months ago
Clustering on Complex Graphs
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu, Tian...
TNN
1998
76views more  TNN 1998»
13 years 8 months ago
Multiobjective genetic algorithm partitioning for hierarchical learning of high-dimensional pattern spaces: a learning-follows-d
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
Rajeev Kumar, Peter Rockett
SODA
2010
ACM
219views Algorithms» more  SODA 2010»
14 years 6 months ago
Algorithms and Complexity for Periodic Real-Time Scheduling
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...
CAV
2008
Springer
99views Hardware» more  CAV 2008»
13 years 10 months ago
Correcting a Space-Efficient Simulation Algorithm
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
Rob J. van Glabbeek, Bas Ploeger