Sciweavers

409 search results - page 39 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Experiments with English-Persian text retrieval
As the number of non-English documents is increasing dramatically on the web nowadays, the study and design of information retrieval systems for these languages is very important....
Abolfazl AleAhmad, Hadi Amiri, Masoud Rahgozar, Fa...
SMI
2010
IEEE
120views Image Analysis» more  SMI 2010»
13 years 6 months ago
Single-Cycle Plain-Woven Objects
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...
Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L....
ICTAI
2010
IEEE
13 years 5 months ago
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
Una Benlic, Jin-Kao Hao
GD
1998
Springer
13 years 11 months ago
Geometric Thickness of Complete Graphs
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
Michael B. Dillencourt, David Eppstein, Daniel S. ...
ICPP
1994
IEEE
13 years 11 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández