Sciweavers

1757 search results - page 61 / 352
» Alternating Refinement Relations
Sort
View
STRINGOLOGY
2008
15 years 2 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
SYRCODIS
2007
72views Database» more  SYRCODIS 2007»
15 years 1 months ago
An XML-to-Relational User-Driven Mapping Strategy Based on Similarity and Adaptivity
As XML has become a standard for data representation, it is inevitable to propose and implement techniques for efficient managing of XML data. A natural alternative is to exploit...
Irena Mlynkova
94
Voted
BMCBI
2010
110views more  BMCBI 2010»
15 years 20 days ago
Concept-based query expansion for retrieving gene related publications from MEDLINE
Background: Advances in biotechnology and in high-throughput methods for gene analysis have contributed to an exponential increase in the number of scientific publications in thes...
Sérgio Matos, Joel Arrais, João Maia...
95
Voted
ICRA
2010
IEEE
121views Robotics» more  ICRA 2010»
14 years 11 months ago
On the global optimum of planar, range-based robot-to-robot relative pose estimation
Abstract— In this paper, we address the problem of determining the relative position and orientation (pose) of two robots navigating in 2D, based on known egomotion and noisy rob...
Nikolas Trawny, Stergios I. Roumeliotis
EDBTW
2006
Springer
15 years 4 months ago
Preference-Driven Querying of Inconsistent Relational Databases
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowsk...