Sciweavers

90 search results - page 11 / 18
» ccr 2006
Sort
View
FSTTCS
2006
Springer
14 years 1 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...
JOC
2002
76views more  JOC 2002»
13 years 9 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
JPDC
2000
95views more  JPDC 2000»
13 years 9 months ago
Permutation Capability of Optical Multistage Interconnection Networks
In this paper, we study optical multistage interconnection networks (MINs). Advances in electro-optic technologies have made optical communication a promising networking choice to...
Yuanyuan Yang, Jianchao Wang, Yi Pan
JCP
2006
92views more  JCP 2006»
13 years 9 months ago
A Novel Pulse Echo Correlation Tool for Transmission Path Testing and Fault Diagnosis
Abstract-- In this paper a novel pulse sequence testing methodology is presented [22] as an alternative to Time Domain Reflectometry (TDR) for transmission line health condition mo...
David M. Horan, Richard A. Guinee
ACID
2006
236views Algorithms» more  ACID 2006»
13 years 11 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....