Sciweavers

932 search results - page 81 / 187
» Where in the Wikipedia Is That Answer
Sort
View
ICCS
2005
Springer
14 years 2 months ago
What Makes the Arc-Preserving Subsequence Problem Hard?
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, St&...
ICTCS
2005
Springer
14 years 2 months ago
Weighted Coloring: Further Complexity and Approximability Results
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
Bruno Escoffier, Jérôme Monnot, Vange...
ISSADS
2005
Springer
14 years 2 months ago
Extending Databases to Precision-Controlled Retrieval of Qualitative Information
A hierarchy is an arrangement of qualitative values in a tree with certain properties. Hierarchies allow to define the confusion conf(r, s) in using qualitative value r instead of ...
Victor-Polo de Gyves, Adolfo Guzmán-Arenas,...
SSD
2005
Springer
175views Database» more  SSD 2005»
14 years 2 months ago
Probabilistic Spatial Queries on Existentially Uncertain Data
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thre...
Xiangyuan Dai, Man Lung Yiu, Nikos Mamoulis, Yufei...
SIGOPSE
2004
ACM
14 years 2 months ago
Energy-efficient cluster-based service discovery for Ubiquitous Computing
: Service discovery in Ubiquitous Computing is a task which has to be done frequently due to dynamically changing environments. The limited battery power of mobile devices requires...
Gregor Schiele, Christian Becker, Kurt Rothermel