3008 search results - page 530 / 602 » Independence in connected graphs |
172
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
176
click to vote
APVIS
2006
15 years 7 months ago
2006
Centrality analysis determines the importance of vertices in a network based on their connectivity within the network structure. It is a widely used technique to analyse network-s...
160
click to vote
FLAIRS
2004
15 years 7 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
142
click to vote
IJCAI
1993
15 years 7 months ago
1993
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
198
click to vote
ICMCS
2010
IEEE
15 years 7 months ago
2010
IEEE
Labeling persons appearing in video frames with names detected from the video transcript helps improving the video content identification and search task. We develop a face naming...