Sciweavers

3455 search results - page 618 / 691
» Generalized Game Trees
Sort
View
NN
2006
Springer
15 years 4 months ago
Self-organizing neural networks to support the discovery of DNA-binding motifs
Identification of the short DNA sequence motifs that serve as binding targets for transcription factors is an important challenge in bioinformatics. Unsupervised techniques from t...
Shaun Mahony, Panayiotis V. Benos, Terry J. Smith,...
TKDE
2008
128views more  TKDE 2008»
15 years 4 months ago
A Virtual Ring Method for Building Small-World Structured P2P Overlays
This paper presents a general virtual ring method to design and analyze small-world structured P2P networks on the base es embedded in ID spaces with distance metric. Its basic ide...
Hai Zhuge, Xiaoping Sun
CORR
2004
Springer
100views Education» more  CORR 2004»
15 years 4 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
15 years 4 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
CG
1998
Springer
15 years 4 months ago
Smooth transitions in texture-based simplification
We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, ...
Daniel G. Aliaga, Anselmo Lastra