Sciweavers

202 search results - page 32 / 41
» Locally identifying coloring of graphs
Sort
View
IAT
2010
IEEE
14 years 9 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
ECCV
2010
Springer
14 years 12 months ago
Segmenting Salient Objects from Images and Videos
Abstract. In this paper we introduce a new salient object segmentation method, which is based on combining a saliency measure with a conditional random field (CRF) model. The propo...
Esa Rahtu, Juho Kannala, Mikko Salo, Janne Heikkil...
CORR
2011
Springer
138views Education» more  CORR 2011»
14 years 6 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
EMMCVPR
2001
Springer
15 years 4 months ago
Grouping with Directed Relationships
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
Stella X. Yu, Jianbo Shi
RAID
2005
Springer
15 years 5 months ago
Polymorphic Worm Detection Using Structural Information of Executables
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
Christopher Krügel, Engin Kirda, Darren Mutz,...