(Korf, Reid, & Edelkamp 2001) introduced a formula to predict the number of nodes IDA* will expand given the static distribution of heuristic values. Their formula proved to be very accurate but it is only accurate under the following limitations: (1) the heuristic must be consistent; (2) the prediction is for a large random sample of start states (or for large thresholds). In this paper we gen...

In this article, we discuss the security of double-blocklength (DBL) hash functions against the free-start collision attack. We focus on the DBL hash functions composed of compression functions of the form F(x) = ( f (x), f (p(x))), where f is a smaller compression function and p is a permutation. We first show, in the random oracle model, that a significantly good upper bound can be obtained o...

An inherent assumption in many search techniques is that information from existing solution(s) can help guide the search process to find better solutions. For example, memetic algorithms can use information from existing local optima to effectively explore a globally convex search space, and genetic algorithms assemble new solution candidates from existing solution components. At the extreme, t...

This paper describes the Intelius-NYU 2012 system for the KBP Cold Start task. The Cold Start task can be decomposed into two subtasks: slot filling and entity linking. For slot filling, we focus on the adaptation of the NYU 2011 regular slot filling system to the Cold Start task. For entity linking, we apply Intelius‘s commercial conflation engine to link person and organization entities with ...

The market basket data in the form of a binary user-item matrix or a binary item-user matrix can be modelled as a binary classification problem. The binary logistic regression approach tackles the binary classification problem, where principal components are predictor variables. If users or items are sparse in the training data, the binary classification problem can be considered as a cold-star...

(Korf, Reid, and Edelkamp 2001) introduced a formula to predict the number of nodes IDA* will expand given the static distribution of heuristic values. Their formula proved to be very accurate but it is only accurate under the following limitations: (1) the heuristic must be consistent; (2) the prediction is for a large random sample of start states (or for large thresholds). In this paper we g...

When a new user registers to a recommender system service, the system does not know her taste and cannot propose meaningful suggestions (cold-start problem). This preliminary work attempts to mitigate the cold-start problem using the profile picture of the user as a sole information, following the intuition that a correspondence may exist between the pictures that people use to represent themse...

7 Submission date: November 13, 2009 8 Number of Tables and Figures: 6 9 Total Word Count: 7476 (including 250 words for each Figure/Table) 10 11 12 13 14 15 16 17 18 19 20 21 22 Mitchell K. Robinson (corresponding author) 23 University of Vermont 24 33 Colchester Avenue 25 Burlington, VT 05405 26 Phone: (716) 474-2964 27 Email: [email protected] 28 29 Karen M. Sentoff 30 University of ...

E-learning systems often include a personalization component, which adapts the learning content to the learner’s particular needs. One obstacle to personalization is the question of how to obtain a learner profile for a learner who just starts using an E-learning system without overwhelming her with questions or unsuitable learning material. One possible solution to this problem lies in the soc...

Scientific full text papers are usually stored in separate places than their underlying research datasets. Authors typically make references to datasets by mentioning them for example by using their titles and the year of publication. However, in most cases explicit links that would provide readers with direct access to referenced datasets are missing. Manually detecting references to datasets ...