Sciweavers

430 search results - page 34 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
TKDE
1998
102views more  TKDE 1998»
14 years 10 months ago
Fast and Effective Retrieval of Medical Tumor Shapes
—We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (“Find tumors that are similar to a given patter...
Flip Korn, Nikolaos Sidiropoulos, Christos Falouts...
TCSV
2010
14 years 5 months ago
Efficient and Robust Detection of Duplicate Videos in a Large Database
We present an efficient and accurate method for duplicate video detection in a large database using video fingerprints. We have empirically chosen the Color Layout Descriptor, a c...
Anindya Sarkar, Vishwakarma Singh, Pratim Ghosh, B...
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
15 years 12 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu
DAC
2005
ACM
15 years 11 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
EVOW
2009
Springer
15 years 5 months ago
Improving Performance in Combinatorial Optimisation Using Averaging and Clustering
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
Mohamed Qasem, Adam Prügel-Bennett