Sciweavers

12052 search results - page 680 / 2411
» computing 2010
Sort
View
ICASSP
2010
IEEE
15 years 7 months ago
Fast semi-supervised image segmentation by novelty selection
The goal of semi-supervised image segmentation is to obtain the segmentation from a partially labeled image. By utilizing the image manifold structure in labeled and unlabeled pix...
António R. C. Paiva, Tolga Tasdizen
DSS
2006
116views more  DSS 2006»
15 years 7 months ago
Matching knowledge elements in concept maps using a similarity flooding algorithm
Concept mapping systems used in education and knowledge management emphasize flexibility of representation to enhance learning and facilitate knowledge capture. Collections of con...
Byron Marshall, Hsinchun Chen, Therani Madhusudan
EOR
2007
87views more  EOR 2007»
15 years 7 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...
INFORMATICALT
2010
116views more  INFORMATICALT 2010»
15 years 4 months ago
A Dynamic Network Interdiction Problem
We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the ne...
Brian J. Lunday, Hanif D. Sherali
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
16 years 4 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan