Sciweavers

760 search results - page 121 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
MM
2004
ACM
195views Multimedia» more  MM 2004»
14 years 1 months ago
Hierarchical clustering of WWW image search results using visual, textual and link information
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
Deng Cai, Xiaofei He, Zhiwei Li, Wei-Ying Ma, Ji-R...
IAT
2010
IEEE
13 years 5 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
IJRR
2010
115views more  IJRR 2010»
13 years 4 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
ICDE
2007
IEEE
103views Database» more  ICDE 2007»
14 years 9 months ago
A Semantic Approach to Discovering Schema Mapping Expressions
In many applications it is important to find a meaningful relationship between the schemas of a source and target database. This relationship is expressed in terms of declarative ...
Alexander Borgida, John Mylopoulos, Renée J...
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
14 years 8 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt