Sciweavers

3946 search results - page 198 / 790
» The computational complexity of choice sets
Sort
View
IIE
2007
114views more  IIE 2007»
15 years 6 months ago
Design and Implementation of a Logo-based Computer Graphics Course
Two years ago the Faculty of Mathematics and Informatics at Sofia University makes a decision to design a new series of Logo-based courses which make use of the modern technology....
Pavel Boytchev
ICDE
2002
IEEE
164views Database» more  ICDE 2002»
16 years 8 months ago
Towards Meaningful High-Dimensional Nearest Neighbor Search by Human-Computer Interaction
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
Charu C. Aggarwal
ISMB
1993
15 years 8 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
ICPR
2010
IEEE
15 years 4 months ago
Automatic Attribute Threshold Selection for Blood Vessel Enhancement
Attribute filters allow enhancement and extraction of features without distorting their borders, and never introduce new image features. These are highly desirable properties in bi...
Fred N. Kiwanuka, Michael H. F. Wilkinson
CRYPTO
2007
Springer
143views Cryptology» more  CRYPTO 2007»
16 years 24 days ago
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
To date the NTRUEncrypt security parameters have been based on the existence of two types of attack: a meet-in-the-middle attack due to Odlyzko, and a conservative extrapolation of...
Nick Howgrave-Graham