Sciweavers

1984 search results - page 41 / 397
» The colourful feasibility problem
Sort
View
ICIP
2001
IEEE
14 years 11 months ago
Shape measures for image retrieval
One of the main goals in Content Based Image Retrieval (CBIR) is to incorporate shape into the process in a reliable manner. In order to overcome the difficulties of directly obta...
George Gagaudakis, Paul L. Rosin
CCCG
2006
13 years 11 months ago
Tight Bounds for Point Recolouring
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
Yurai Núñez Rodríguez, David ...
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 10 months ago
Minimum cost distributed source coding over a network
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
Aditya Ramamoorthy
ITS
2010
Springer
171views Multimedia» more  ITS 2010»
14 years 2 months ago
Identifying Problem Localization in Peer-Review Feedback
Abstract. In this paper, we use supervised machine learning to automatically identify the problem localization of peer-review feedback. Using five features extracted via Natural L...
Wenting Xiong, Diane J. Litman
PODC
2011
ACM
13 years 23 days ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela