Sciweavers

1477 search results - page 64 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
MVA
2008
305views Computer Vision» more  MVA 2008»
14 years 9 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong
WWW
2004
ACM
15 years 10 months ago
Authoring of learning styles in adaptive hypermedia: problems and solutions
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...
Natalia Stash, Alexandra I. Cristea, Paul De Bra
ICCD
2006
IEEE
137views Hardware» more  ICCD 2006»
15 years 6 months ago
Reduction of Crosstalk Pessimism using Tendency Graph Approach
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
Murthy Palla, Klaus Koch, Jens Bargfrede, Manfred ...
JAL
2006
101views more  JAL 2006»
14 years 9 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
FOCS
2002
IEEE
15 years 2 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