Sciweavers

7123 search results - page 362 / 1425
» The Ordered Set of Rough Sets
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 10 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
SIGGRAPH
1993
ACM
15 years 11 months ago
Wavelet radiosity
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
Steven J. Gortler, Peter Schröder, Michael F....
RECOMB
2000
Springer
15 years 10 months ago
Contig selection in physical mapping
In physical mapping, one orders a set of genetic landmarks or a library of cloned fragments of DNA according to their position in the genome. Our approach to physical mapping divi...
Steffen Heber, Jens Stoye, Jörg D. Hoheisel, ...
IJSN
2006
65views more  IJSN 2006»
15 years 6 months ago
The loop fallacy and deterministic serialisation in tracing intrusion connections through stepping stones
: In order to conceal their identity and origin, network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate `stepping ...
Xinyuan Wang
NAR
2002
164views more  NAR 2002»
15 years 6 months ago
SCOP database in 2002: refinements accommodate structural genomics
The SCOP (Structural Classification of Proteins) database is a comprehensive ordering of all proteins of known structure, according to their evolutionary and structural relationsh...
Loredana Lo Conte, Steven E. Brenner, Tim J. P. Hu...