Sciweavers

554 search results - page 61 / 111
» Approximation algorithms and hardness results for labeled co...
Sort
View
CEC
2003
IEEE
14 years 29 days ago
Learning DFA: evolution versus evidence driven state merging
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
Simon M. Lucas, T. Jeff Reynolds
CIKM
2010
Springer
13 years 6 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
AINA
2007
IEEE
14 years 2 months ago
An Adaptive Localized Algorithm for Multiple Sensor Area Coverage
— Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of t...
Antoine Gallais, Jean Carle
IPL
2008
89views more  IPL 2008»
13 years 7 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
CVPR
2007
IEEE
14 years 9 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler