Sciweavers

2796 search results - page 141 / 560
» The coolest path problem
Sort
View
DEXA
2003
Springer
113views Database» more  DEXA 2003»
15 years 10 months ago
Termination Analysis of Active Rules with Priorities
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...
Alain Couchot
ICRA
2010
IEEE
161views Robotics» more  ICRA 2010»
15 years 3 months ago
DisCoverage: A new paradigm for multi-robot exploration
— The main aspect in multi-robot exploration is the efficient coordination of a group of robots. Inspired by previous results on the coverage problem, we propose a novel, fronti...
A. Dominik Haumann, Kim D. Listmann, Volker Willer...
GCB
2010
Springer
145views Biometrics» more  GCB 2010»
15 years 3 months ago
Shape-based Barrier Estimation for RNAs
: The ability of some RNA molecules to switch between different metastable conformations plays an important role in cellular processes. In order to identify such molecules and to p...
Sergiy Bogomolov, Martin Mann, Björn Voß...
CISS
2010
IEEE
14 years 8 months ago
On the LASSO and Dantzig selector equivalence
—Recovery of sparse signals from noisy observations is a problem that arises in many information processing contexts. LASSO and the Dantzig selector (DS) are two well-known schem...
Muhammad Salman Asif, Justin K. Romberg
VLDB
2012
ACM
361views Database» more  VLDB 2012»
14 years 18 days ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...