Sciweavers

2558 search results - page 118 / 512
» Analysis of Generalized Pattern Searches
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 1 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
MM
2006
ACM
93views Multimedia» more  MM 2006»
15 years 3 months ago
A scalable service for photo annotation, sharing, and search
In this work we present the details of the implementation of Fotofiti(FF), a website that provides automatic semantic annotation of digital photographs, event management and soci...
Benjamin N. Lee, WenYen Chen, Edward Y. Chang
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
14 years 11 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
ICDAR
2009
IEEE
15 years 4 months ago
An RDF-Based Blackboard Architecture for Improving Table Analysis
Table analysis is a complex problem, involving searching solutions from a large search space. Studies show that finding the most credible answers to complex problems often requir...
Vanessa Long
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Characteristic relational patterns
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
Arne Koopman, Arno Siebes