Sciweavers

3220 search results - page 462 / 644
» Constrained Graph Processes
Sort
View
MOBIHOC
2008
ACM
16 years 6 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
LATA
2009
Springer
16 years 1 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
ISCIS
2009
Springer
16 years 29 days ago
Construction of examination timetables based on ordering heuristics
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
Syariza Abdul Rahman, Andrzej Bargiela, Edmund K. ...
SMI
2008
IEEE
110views Image Analysis» more  SMI 2008»
16 years 24 days ago
OCTOR: OCcurrence selecTOR in pattern hierarchies
Hierarchies of patterns of features, of sub-assemblies, or of CSG sub-expressions are used in architectural and mechanical CAD to eliminate laborious repetitions from the design p...
Justin Jang, Jarek Rossignac
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
16 years 22 days ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han