Sciweavers

185 search results - page 2 / 37
» Bounded-Curvature Path Normalization
Sort
View
MICS
2010
124views more  MICS 2010»
13 years 2 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 8 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 1 months ago
Coverage control for nonholonomic agents
— Consider a coverage problem for a team of agents in the plane: target points appear sporadically over time in a bounded environment and must be visited by one of the agents. It...
John Enright, Ketan Savla, Emilio Frazzoli
ICASSP
2011
IEEE
12 years 11 months ago
A proportionate adaptive algorithm with variable partitioned block length for acoustic echo cancellation
Due to the nature of an acoustic enclosure, the early part (i.e., direct path and early reflections) of the acoustic echo path is often sparse while the late reverberant part of ...
Pradeep Loganathan, Emanuel A. P. Habets, Patrick ...
ICPR
2010
IEEE
13 years 10 months ago
Normalized Sum-Over-Paths Edit Distances
Abstract--In this paper, normalized SoP string-edit distances, taking into account all possible alignments between two sequences, are investigated. These normalized distances are v...
Silvia García, François Fouss, Masashi Shimbo, M...