Sciweavers

1326 search results - page 242 / 266
» Approximate Tree Kernels
Sort
View
DAGSTUHL
2006
15 years 3 months ago
Program Compression
Abstract. The talk focused on a grammar-based technique for identifying redundancy in program code and taking advantage of that redundancy to reduce the memory required to store an...
William S. Evans
NIPS
2001
15 years 3 months ago
Estimating Car Insurance Premia: a Case Study in High-Dimensional Data Inference
Estimating insurance premia from data is a difficult regression problem for several reasons: the large number of variables, many of which are discrete, and the very peculiar shape...
Nicolas Chapados, Yoshua Bengio, Pascal Vincent, J...
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 3 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
IJCAI
2003
15 years 3 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
UAI
2001
15 years 3 months ago
Exact Inference in Networks with Discrete Children of Continuous Parents
Many real life domains contain a mixture of discrete and continuous variables and can be modeled as hybrid Bayesian Networks (BNs). An important subclass of hybrid BNs are conditi...
Uri Lerner, Eran Segal, Daphne Koller