Sciweavers

721 search results - page 85 / 145
» Graphs with Large Obstacle Numbers
Sort
View
DM
2002
186views more  DM 2002»
13 years 9 months ago
Coloring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
Bojan Mohar
SPDP
1991
IEEE
14 years 21 days ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
ICASSP
2010
IEEE
13 years 9 months ago
Voice quality evaluation of various codecs
In this paper a large amount of absolute mean opinion scores obtained within a single listening test are presented. Naïve listeners’ preference on different speech signal prope...
Anssi Rämö
ECCB
2005
IEEE
14 years 2 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 22 days ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...