Sciweavers

5105 search results - page 158 / 1021
» An algorithm to determine peer-reviewers
Sort
View
IMR
1999
Springer
15 years 5 months ago
Volume Decomposition and Feature Recognition for Hexahedral Mesh Generation
Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classe...
Yong Lu, Rajit Gadh, Timothy J. Tautges
83
Voted
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
16 years 1 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
97
Voted
ICDAR
2009
IEEE
15 years 7 months ago
Voronoi++: A Dynamic Page Segmentation Approach Based on Voronoi and Docstrum Features
This paper presents a dynamic approach to document page segmentation. Current page segmentation algorithms lack the ability to dynamically adapt local variations in the size, orie...
Mudit Agrawal, David S. Doermann
ATAL
2009
Springer
15 years 7 months ago
A mixed multi-unit combinatorial auctions test suite
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit c...
Andrea Giovannucci, Jesús Cerquides, Ulle E...
118
Voted
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
15 years 7 months ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian