Sciweavers

493 search results - page 85 / 99
» Quantum Query Complexity of Some Graph Problems
Sort
View
ML
2008
ACM
14 years 9 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer
ICDE
1998
IEEE
103views Database» more  ICDE 1998»
15 years 11 months ago
Online Generation of Association Rules
We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the d...
Charu C. Aggarwal, Philip S. Yu
PODS
2005
ACM
131views Database» more  PODS 2005»
15 years 9 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
ECCV
2008
Springer
15 years 11 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...
SIGGRAPH
1997
ACM
15 years 1 months ago
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
Frédo Durand, George Drettakis, Claude Puec...