Sciweavers

1566 search results - page 75 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 8 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
BMCBI
2007
134views more  BMCBI 2007»
13 years 8 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...
IPL
2000
77views more  IPL 2000»
13 years 8 months ago
Efficient loopless generation of Gray codes for k-ary trees
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
Limin Xiang, Kazuo Ushijima, Changjie Tang
ASPDAC
2001
ACM
104views Hardware» more  ASPDAC 2001»
13 years 12 months ago
Optimal spacing and capacitance padding for general clock structures
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
Yu-Min Lee, Hing Yin Lai, Charlie Chung-Ping Chen
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 9 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella