Sciweavers

1088 search results - page 159 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
IPPS
1999
IEEE
15 years 3 months ago
COWL: Copy-On-Write for Logic Programs
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
Vítor Santos Costa
CVPR
2010
IEEE
15 years 4 months ago
ARISTA - Image Search to Annotation on Billions of Web Photos
Though it has cost great research efforts for decades, object recognition is still a challenging problem. Traditional methods based on machine learning or computer vision are stil...
Xin-Jing Wang, Ming Liu, Lei Zhang, Yi Li, Wei-Yin...
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
15 years 3 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
105
Voted
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 2 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
KAIS
2010
139views more  KAIS 2010»
14 years 9 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf