984 search results - page 103 / 197 » ideas 2010 |
114
Voted
LATA
2010
Springer
15 years 6 months ago
2010
Springer
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...
100
Voted
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
127
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
116
Voted
PODS
2010
ACM
15 years 5 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
108
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We propose new ideas and efficient algorithms towards bridging the gap between bag-of-features and constellation descriptors for image matching. Specifically, we show ho...