Sciweavers

2191 search results - page 163 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
15 years 11 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
152
Voted
SQJ
2002
106views more  SQJ 2002»
15 years 5 months ago
Energy Metric for Software Systems
Acknowledging the intense requirement for low power operation in most portable computing systems, this paper introduces the notion of energy efficient software design and proposes ...
Alexander Chatzigeorgiou, George Stephanides
ECCV
2008
Springer
16 years 8 months ago
Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search
This paper improves recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We, first, analyze bag-of-features in t...
Herve Jegou, Matthijs Douze, Cordelia Schmid
GD
1998
Springer
15 years 10 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
DCC
1996
IEEE
15 years 10 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin