Sciweavers

3602 search results - page 103 / 721
» Isn't It About Time
Sort
View
IJNSEC
2008
96views more  IJNSEC 2008»
13 years 9 months ago
Weak Composite Diffie-Hellman
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polyno...
Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasiz...
PRL
2008
88views more  PRL 2008»
13 years 9 months ago
Time-efficient spam e-mail filtering using n-gram models
In this paper, we propose spam e-mail filtering methods having high accuracies and low time complexities. The methods are based on the n-gram approach and a heuristics which is re...
Ali Çiltik, Tunga Güngör
JACM
2010
135views more  JACM 2010»
13 years 7 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
13 years 4 months ago
Dynamic product assembly and inventory control for maximum profit
We consider a manufacturing plant that purchases raw materials for product assembly and then sells the final products to customers. There are M types of raw materials and K types o...
Michael J. Neely, Longbo Huang
JSSPP
2004
Springer
14 years 2 months ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan