We describe an architecture-centric design and implementation approach for building self-adapting and selfmanaging robotics systems. The basis of our approach is the concept of me...
George Edwards, Joshua Garcia, Hossein Tajalli, Da...
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Background: Most genomic data have ultra-high dimensions with more than 10,000 genes (probes). Regularization methods with L1 and Lp penalty have been extensively studied in survi...
Zhenqiu Liu, Dechang Chen, Ming Tan, Feng Jiang, R...
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...