Sciweavers

3471 search results - page 659 / 695
» Obstacle Numbers of Graphs
Sort
View
173
Voted
WABI
2009
Springer
142views Bioinformatics» more  WABI 2009»
15 years 10 months ago
Back-Translation for Discovering Distant Protein Homologies
Background: Frameshift mutations in protein-coding DNA sequences produce a drastic change in the resulting protein sequence, which prevents classic protein alignment methods from ...
Marta Gîrdea, Laurent Noé, Gregory Ku...
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
15 years 10 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
WINE
2009
Springer
178views Economy» more  WINE 2009»
15 years 10 months ago
The Geometry of Truthfulness
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
Angelina Vidali
CIKM
2009
Springer
15 years 10 months ago
Interactive, topic-based visual text summarization and analysis
We are building an interactive, visual text analysis tool that aids users in analyzing a large collection of text. Unlike existing work in text analysis, which focuses either on d...
Shixia Liu, Michelle X. Zhou, Shimei Pan, Weihong ...
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
15 years 10 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi