Sciweavers

83 search results - page 3 / 17
» Improving the Efficiency of Sorting by Reversals
Sort
View
MSO
2003
13 years 9 months ago
Simulation based Development of Efficient Hardware for Sort based Algorithms
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
Niklas Hansson, Jay H. Harris
RECOMB
2007
Springer
14 years 8 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
14 years 8 months ago
JouleSort: a balanced energy-efficiency benchmark
The energy efficiency of computer systems is an important concern in a variety of contexts. In data centers, reducing energy use improves operating cost, scalability, reliability,...
Suzanne Rivoire, Mehul A. Shah, Parthasarathy Rang...
VLDB
2009
ACM
381views Database» more  VLDB 2009»
14 years 7 months ago
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei...
JMLR
2010
111views more  JMLR 2010»
13 years 2 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...