Sciweavers

332 search results - page 47 / 67
» Parameterized Graph Separation Problems
Sort
View
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
13 years 11 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
ECRTS
2007
IEEE
14 years 1 months ago
Predictable Paging in Real-Time Systems: A Compiler Approach
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
Isabelle Puaut, Damien Hardy
CPM
1999
Springer
99views Combinatorics» more  CPM 1999»
13 years 11 months ago
On the Complexity of Positional Sequencing by Hybridization
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Shara...
CVPR
2012
IEEE
11 years 9 months ago
Learning to segment dense cell nuclei with shape prior
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
Xinghua Lou, Ullrich Köthe, Jochen Wittbrodt,...
EDBT
2011
ACM
254views Database» more  EDBT 2011»
12 years 11 months ago
SocialSearch: enhancing entity search with social network matching
This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...
Gae-won You, Seung-won Hwang, Zaiqing Nie, Ji-Rong...