Sciweavers

549 search results - page 63 / 110
» On the Complexity of Restricted k-anonymity Problem
Sort
View
ICIP
1999
IEEE
15 years 11 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
CP
2000
Springer
15 years 2 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
JMLR
2002
144views more  JMLR 2002»
14 years 9 months ago
Round Robin Classification
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
Johannes Fürnkranz
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
15 years 11 months ago
Toward Expressive and Scalable Sponsored Search Auctions
Internet search results are a growing and highly profitable advertising platform. Search providers auction advertising slots to advertisers on their search result pages. Due to the...
David J. Martin, Johannes Gehrke, Joseph Y. Halper...
WG
2007
Springer
15 years 4 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...