Sciweavers

4302 search results - page 521 / 861
» Index Pairs Algorithms
Sort
View
DM
2010
89views more  DM 2010»
15 years 6 months ago
Polynomial-time dualization of r-exact hypergraphs with applications in geometry
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
Khaled M. Elbassioni, Imran Rauf
177
Voted
JALC
2008
72views more  JALC 2008»
15 years 6 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
IJSNET
2006
78views more  IJSNET 2006»
15 years 6 months ago
RICA: a ring-based information collection architecture in wireless sensor networks
: We propose a novel data collection architecture, called Ring-based Information Collection Architecture (RICA), for sensor networks. In the RICA scheme, sensors are organised into...
Shih-Chang Huang, Rong-Hong Jan, Wuu Yang
JIRS
2006
128views more  JIRS 2006»
15 years 6 months ago
A Modified Particle Filter for Simultaneous Localization and Mapping
The implementation of a particle filter (PF) for vision-based bearing-only simultaneous localization and mapping (SLAM) of a mobile robot in an unstructured indoor environment is p...
N. M. Kwok, A. B. Rad
IANDC
2007
117views more  IANDC 2007»
15 years 6 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis