Sciweavers

1403 search results - page 103 / 281
» Set cover algorithms for very large datasets
Sort
View
ICPR
2008
IEEE
15 years 11 months ago
Computer graphics identification using genetic algorithm
This paper proposes the use of genetic algorithm to select an optimal feature set for distinguishing computer graphics from digital photographic images. Our previously developed a...
Wen Chen, Yun Q. Shi, Guorong Xuan, Wei Su
DEXA
2006
Springer
151views Database» more  DEXA 2006»
15 years 6 months ago
An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS
Geographic information systems (GIS) must support large georeferenced data sets. Due to the size of these data sets finding exact answers to spatial queries can be very time consum...
Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger
BMCBI
2006
100views more  BMCBI 2006»
15 years 4 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
15 years 8 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
KDD
2002
ACM
93views Data Mining» more  KDD 2002»
16 years 4 months ago
Interactive deduplication using active learning
Deduplication is a key operation in integrating data from multiple sources. The main challenge in this task is designing a function that can resolve when a pair of records refer t...
Sunita Sarawagi, Anuradha Bhamidipaty