Sciweavers

3244 search results - page 340 / 649
» On convex complexity measures
Sort
View
IANDC
2006
103views more  IANDC 2006»
15 years 6 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
IPL
2008
95views more  IPL 2008»
15 years 6 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
180
Voted
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
JEI
2006
109views more  JEI 2006»
15 years 6 months ago
Robotic three-dimensional imaging system for under-vehicle inspection
We present our research efforts toward the deployment of 3-D sensing technology to an under-vehicle inspection robot. The 3-D sensing modality provides flexibility with ambient lig...
Sreenivas R. Sukumar, David L. Page, Andrei V. Gri...
TEC
2008
88views more  TEC 2008»
15 years 6 months ago
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
This paper describes a simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for ...
Sanghamitra Bandyopadhyay, Sriparna Saha, Ujjwal M...