Sciweavers

477 search results - page 13 / 96
» Removing even crossings
Sort
View
COMPGEOM
2010
ACM
14 years 17 days ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
VIS
2008
IEEE
214views Visualization» more  VIS 2008»
14 years 8 months ago
Estimating Crossing Fibers: A Tensor Decomposition Approach
Diffusion weighted magnetic resonance imaging is a unique tool for non-invasive investigation of major nerve fiber tracts. Since the popular diffusion tensor (DT-MRI) model is limi...
Thomas Schultz, Hans-Peter Seidel
HICSS
2003
IEEE
114views Biometrics» more  HICSS 2003»
14 years 23 days ago
The Effect of Bilingual Term List Size on Dictionary-Based Cross-Language Information Retrieval
Bilingual term lists are extensively used as a resource for dictionary-based Cross-Language Information Retrieval (CLIR), in which the goal is to find documents written in one na...
Dina Demner-Fushman, Douglas W. Oard
ESSOS
2010
Springer
14 years 4 months ago
CsFire: Transparent Client-Side Mitigation of Malicious Cross-Domain Requests
Protecting users in the ubiquitous online world is becoming more and more important, as shown by web application security – or the lack thereof – making the mainstream news. On...
Philippe De Ryck, Lieven Desmet, Thomas Heyman, Fr...
DATE
2005
IEEE
115views Hardware» more  DATE 2005»
14 years 1 months ago
Encoding-Based Minimization of Inductive Cross-Talk for Off-Chip Data Transmission
Inductive cross-talk within IC packaging is becoming a significant bottleneck in high-speed inter-chip communication. The parasitic inductance within IC packaging causes bounce o...
Brock J. LaMeres, Sunil P. Khatri