Sciweavers

502 search results - page 41 / 101
» Monotone Approximation of Decision Problems
Sort
View
ICDE
2011
IEEE
245views Database» more  ICDE 2011»
14 years 4 months ago
Stochastic skyline operator
— In many applications involving the multiple criteria optimal decision making, users may often want to make a personal trade-off among all optimal solutions. As a key feature, t...
Xuemin Lin, Ying Zhang, Wenjie Zhang, Muhammad Aam...
102
Voted
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 5 months ago
Simplifying XML schema: single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Fran...
103
Voted
DAM
2008
131views more  DAM 2008»
15 years 20 days ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 4 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
TODS
2002
92views more  TODS 2002»
15 years 7 days ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella