Sciweavers

7864 search results - page 1273 / 1573
» Clustering Genetic Algorithm
Sort
View
MST
2010
98views more  MST 2010»
15 years 3 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
CONEXT
2010
ACM
15 years 2 months ago
Profiling-By-Association: a resilient traffic profiling solution for the internet backbone
Profiling Internet backbone traffic is becoming an increasingly hard problem since users and applications are avoiding detection using traffic obfuscation and encryption. The key ...
Marios Iliofotou, Brian Gallagher, Tina Eliassi-Ra...
IS
2010
15 years 2 months ago
Building concepts for AI agents using information theoretic Co-clustering
Abstract--High level conceptual thought seems to be at the basis of the impressive human cognitive ability, and AI researchers aim to replicate this ability in artificial agents. C...
Jason R. Chen
PIMRC
2010
IEEE
15 years 2 months ago
On the feasibility of receive collaboration in wireless sensor networks
In this paper, a new type of collaboration in wireless sensor networks (WSN) is suggested that exploits array processing algorithms for better reception of a signal. For receive co...
Behnam Banitalebi, S. Sigg, M. Beigl
DMIN
2009
222views Data Mining» more  DMIN 2009»
15 years 2 months ago
P-Sensitive K-Anonymity for Social Networks
-- The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in th...
Roy Ford, Traian Marius Truta, Alina Campan
« Prev « First page 1273 / 1573 Last » Next »