Sciweavers

203 search results - page 33 / 41
» On Inducing Polygons and Related Problems
Sort
View
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
13 years 11 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
IJCV
2007
144views more  IJCV 2007»
13 years 7 months ago
Generalized Gradients: Priors on Minimization Flows
This paper tackles an important aspect of the variational problem underlying active contours: optimization by gradient flows. Classically, the definition of a gradient depends d...
Guillaume Charpiat, Pierre Maurel, Jean-Philippe P...
JDWM
2007
122views more  JDWM 2007»
13 years 7 months ago
A Hyper-Heuristic for Descriptive Rule Induction
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
Tho Hoan Pham, Tu Bao Ho
AAAI
2011
12 years 7 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
AIIA
2007
Springer
14 years 1 months ago
A Hierarchical Clustering Procedure for Semantically Annotated Resources
Abstract. A clustering method is presented which can be applied to relational knowledge bases. It can be used to discover interesting groupings of resources through their (semantic...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito