Sciweavers

1461 search results - page 155 / 293
» Complexity of Graph Covering Problems
Sort
View
88
Voted
IFIP
2010
Springer
14 years 5 months ago
Autonomic Approach to Planning and Scheduling in Networked Small Factories
The paper considers the complex behavior of a small company in a business ecosystem, time by time leader or supplier or both in one or more supply chains, and points out the data e...
Flavio Bonfatti, Luca Martinelli, Paola Daniela Mo...
ICIP
2007
IEEE
15 years 12 months ago
Modeling of Front Evolution with Graph Cut Optimization
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
Hang Chang, Qing Yang, Manfred Auer, Bahram Parvin
ISBI
2009
IEEE
15 years 5 months ago
Structural Annotation of EM Images by Graph Cut
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
Hang Chang, Manfred Auer, Bahram Parvin
88
Voted
TKDE
2008
125views more  TKDE 2008»
14 years 10 months ago
Discovering and Explaining Abnormal Nodes in Semantic Graphs
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
Shou-de Lin, Hans Chalupsky
105
Voted
FOCS
2002
IEEE
15 years 3 months ago
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
Andrej Bogdanov, Kenji Obata, Luca Trevisan