Sciweavers

396 search results - page 69 / 80
» Crossing Numbers
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
COMPGEOM
2007
ACM
13 years 11 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
OOPSLA
2004
Springer
14 years 21 days ago
AJEER: an aspectJ-enabled eclipse runtime
There are a number of technologies designed to improve modularity in software systems. The technique presented here combines two of them seamlessly to exploit their respective ben...
Martin Lippert
BMCBI
2010
127views more  BMCBI 2010»
13 years 7 months ago
Computational prediction of type III secreted proteins from gram-negative bacteria
Background: Type III secretion system (T3SS) is a specialized protein delivery system in gramnegative bacteria that injects proteins (called effectors) directly into the eukaryoti...
Yang Yang, Jiayuan Zhao, Robyn L. Morgan, Wenbo Ma...
COMCOM
2004
108views more  COMCOM 2004»
13 years 7 months ago
Dynamic establishment of differentiated survivable lightpaths in WDM mesh networks
In the emerging next-generation transport networks, called intelligent optical transport networks, DWDM-based optical components like add-drop multiplexers and optical cross conne...
Chava Vijaya Saradhi, C. Siva Ram Murthy