Results 1 - 10 of 9,642

Planning as satisfiability

by Henry Kautz, Bart Selman - IN ECAI-92 , 1992
"... We develop a formal model of planning based on satisfiability rather than deduction. The satis ability approach not only provides a more flexible framework for stating di erent kinds of constraints on plans, but also more accurately reflects the theory behind modern constraint-based planning systems ..."
Abstract - Cited by 505 (27 self) - Add to MetaCart
We develop a formal model of planning based on satisfiability rather than deduction. The satis ability approach not only provides a more flexible framework for stating di erent kinds of constraints on plans, but also more accurately reflects the theory behind modern constraint-based planning

Reflectance and texture of real-world surfaces

by Kristin J. Dana, Bram van Ginneken, Shree K. Nayar, Jan J. Koenderink - ACM TRANS. GRAPHICS , 1999
"... In this work, we investigate the visual appearance of real-world surfaces and the dependence of appearance on scale, viewing direction and illumination direction. At ne scale, surface variations cause local intensity variation or image texture. The appearance of this texture depends on both illumina ..."
Abstract - Cited by 590 (23 self) - Add to MetaCart
(bidirectional re ectance distribution function). We simultaneously measure the BTF and BRDF of over 60 di erent rough surfaces, each observed with over 200 di erent combinations of viewing and illumination direction. The resulting BTF database is comprised of over 12,000 image textures. To enable convenient use

Nearest neighbor queries.

by Nick Roussopoulos , Stephen Kelley , Fr Ed , Eric Vincent - ACM SIGMOD Record, , 1995
"... Abstract A frequently encountered type of query in Geographic Information Systems is to nd the k nearest neighbor objects to a given point in space. Processing such queries requires substantially di erent search algorithms than those for location or range queries. In this paper we present a n e cie ..."
Abstract - Cited by 592 (1 self) - Add to MetaCart
Abstract A frequently encountered type of query in Geographic Information Systems is to nd the k nearest neighbor objects to a given point in space. Processing such queries requires substantially di erent search algorithms than those for location or range queries. In this paper we present a n e

Anomaly Detection: A Survey

by Varun Chandola, Arindam Banerjee, Vipin Kumar , 2007
"... Anomaly detection is an important problem that has been researched within diverse research areas and application domains. Many anomaly detection techniques have been specifically developed for certain application domains, while others are more generic. This survey tries to provide a structured and c ..."
Abstract - Cited by 540 (5 self) - Add to MetaCart
on the computational complexity of the techniques since it is an important issue in real application domains. We hope that this survey will provide a better understanding of the di®erent directions in which research has been done on this topic, and how techniques developed in one area can be applied in domains

Text Classification using String Kernels

by Huma Lodhi, Craig Saunders, John Shawe-Taylor, Nello Cristianini, Chris Watkins
"... We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily contiguo ..."
Abstract - Cited by 495 (7 self) - Add to MetaCart
) show positive results on modestly sized datasets. The case of contiguous subsequences is also considered for comparison with the subsequences kernel with di erent decay factors. For larger documents and datasets the paper introduces an approximation technique that is shown to deliver good

Features of similarity.

by Amos Tversky - Psychological Review , 1977
"... Similarity plays a fundamental role in theories of knowledge and behavior. It serves as an organizing principle by which individuals classify objects, form concepts, and make generalizations. Indeed, the concept of similarity is ubiquitous in psychological theory. It underlies the accounts of stimu ..."
Abstract - Cited by 1455 (2 self) - Add to MetaCart
of stimulus and response generalization in learning, it is employed to explain errors in memory and pattern recognition, and it is central to the analysis of connotative meaning. Similarity or dissimilarity data appear in di¤erent forms: ratings of pairs, sorting of objects, communality between associations

Extracting patterns and relations from the world wide web

by Sergey Brin - In WebDB Workshop at 6th International Conference on Extending Database Technology, EDBT’98 , 1998
"... Abstract. The World Wide Web is a vast resource for information. At the same time it is extremely distributed. A particular type of data such as restaurant lists may be scattered across thousands of independent information sources in many di erent formats. In this paper, we consider the problem of e ..."
Abstract - Cited by 471 (1 self) - Add to MetaCart
Abstract. The World Wide Web is a vast resource for information. At the same time it is extremely distributed. A particular type of data such as restaurant lists may be scattered across thousands of independent information sources in many di erent formats. In this paper, we consider the problem

A Concrete Security Treatment of Symmetric Encryption

by M. Bellare, A. Desai, E. Jokipii, P. Rogaway - Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE , 1997
"... We study notions and schemes for symmetric (ie. private key) encryption in a concrete security framework. We give four di erent notions of security against chosen plaintext attack and analyze the concrete complexity ofreductions among them, providing both upper and lower bounds, and obtaining tight ..."
Abstract - Cited by 421 (65 self) - Add to MetaCart
We study notions and schemes for symmetric (ie. private key) encryption in a concrete security framework. We give four di erent notions of security against chosen plaintext attack and analyze the concrete complexity ofreductions among them, providing both upper and lower bounds, and obtaining tight

Learning Aggregations and Selections with

by Relational Neural Networks, Werner Uwents, Celine Vens, Anneleen Van Assche
"... We make an assessment of the expressiveness of relational neural networks to learn di#erent kinds of concepts over relational domains. ..."
Abstract - Add to MetaCart
We make an assessment of the expressiveness of relational neural networks to learn di#erent kinds of concepts over relational domains.

Routing indices for peer-to-peer systems

by Arturo Crespo, Hector Garcia-molina , 2002
"... Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or ooding the network with queries. In this paper we introduce the concept of Routing Indices (RIs), which allow nodes to forward queries to neighbors that are more likely to have answers. I ..."
Abstract - Cited by 423 (15 self) - Add to MetaCart
routing indices. We evaluate their performance via simulations, and nd that RIs can improve performance by one or two orders of magnitude vs. a ooding-based system, and by up to 100 % vs. a random forwarding system. We also discuss the tradeo s between the di erent RIschemes and highlight the e ects
Results 1 - 10 of 9,642