Sciweavers

3257 search results - page 173 / 652
» Some Results on Effective Randomness
Sort
View
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
16 years 7 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy
CEC
2009
IEEE
16 years 1 months ago
Tackling high dimensional nonseparable optimization problems by cooperatively coevolving particle swarms
— This paper attempts to address the question of scaling up Particle Swarm Optimization (PSO) algorithms to high dimensional optimization problems. We present a cooperative coevo...
Xiaodong Li, Xin Yao
CLEF
2008
Springer
15 years 8 months ago
A Comparative Study of Diversity Methods for Hybrid Text and Image Retrieval Approaches
This article compares eight different diversity methods: 3 based on visual information, 1 based on date information, 3 adapted to each topic based on location and visual informatio...
Sabrina Tollari, Philippe Mulhem, Marin Ferecatu, ...
TWC
2008
108views more  TWC 2008»
15 years 6 months ago
Successive-Capture Analysis of RTS/CTS in Ad-Hoc Networks
We consider a wireless ad-hoc network with random ALOHA transmissions between nodes. However nodes can decide to use the Request-to-Send (RTS) / Clear-to-Send (CTS) protocol for oc...
Chin Keong Ho, Jean-Paul M. G. Linnartz
PAMI
2007
176views more  PAMI 2007»
15 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas