Sciweavers

438 search results - page 47 / 88
» On Perfect Switching Classes
Sort
View
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
14 years 25 days ago
Dynamic Data Structures for Fat Objects and Their Applications
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 8 months ago
Shortest paths between shortest paths and independent sets
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
Marcin Kaminski, Paul Medvedev, Martin Milanic
BIOINFORMATICS
2006
96views more  BIOINFORMATICS 2006»
13 years 8 months ago
Joint estimation of calibration and expression for high-density oligonucleotide arrays
Motivation: The need for normalization in microarray experiments has been well documented in the literature. Currently, most analysis methods treat normalization and analysis as a...
Ann L. Oberg, Douglas W. Mahoney, Karla V. Ballman...
IJSN
2006
78views more  IJSN 2006»
13 years 8 months ago
An approach to synthesise safe systems
: Detectors are system components that identify whether the system is in a particular state. Detectors can be used to ensure arbitrary safety properties for systems, that is, they ...
Arshad Jhumka, Felix C. Freiling, Christof Fetzer,...
JCT
2007
83views more  JCT 2007»
13 years 8 months ago
On 6-sparse Steiner triple systems
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We the...
A. D. Forbes, Mike J. Grannell, Terry S. Griggs