Sciweavers

1859 search results - page 279 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
ECCV
2010
Springer
15 years 8 months ago
Optimal Contour Closure by Superpixel Grouping
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
RAID
2010
Springer
15 years 3 months ago
A Data-Centric Approach to Insider Attack Detection in Database Systems
The insider threat against database management systems is a dangerous security problem. Authorized users may abuse legitimate privileges to masquerade as other users or to maliciou...
Sunu Mathew, Michalis Petropoulos, Hung Q. Ngo, Sh...
CVPR
2003
IEEE
16 years 6 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath
CHI
2006
ACM
16 years 5 months ago
Verbosity: a game for collecting common-sense facts
We address the problem of collecting a database of "common-sense facts" using a computer game. Informally, a common-sense fact is a true statement about the world that i...
Luis von Ahn, Mihir Kedia, Manuel Blum
ICAI
2008
15 years 6 months ago
Nonrestrictive Concept-Acquisition by Representational Redescription
coarse procedures or very abstract frames from the point of view of algorithm, because some crucial issues like the representation, evolution, storage, and learning process of conc...
Hui Wei, Yan Chen