Sciweavers

101 search results - page 20 / 21
» Fast approximation of the permanent for very dense problems
Sort
View
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
13 years 11 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
ICIP
1999
IEEE
14 years 6 months ago
Programmable Hardware Implementation for the Median-Rational Hybrid Filters
The Median-Rational Hybrid Filter (MRHF) has been recently introduced [1][2] as a new class of nonlinear filters and successfully applied to image filtering problems. The main cha...
Lazhar Khriji, Giuseppe Bernacchia, Moncef Gabbouj...
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
13 years 10 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
VLDB
2001
ACM
114views Database» more  VLDB 2001»
13 years 9 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
DCC
2000
IEEE
13 years 9 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...