Sciweavers

1247 search results - page 54 / 250
» A Generalization of Jumps and Labels
Sort
View
DBSEC
2006
144views Database» more  DBSEC 2006»
13 years 11 months ago
Policy Classes and Query Rewriting Algorithm for XML Security Views
Most state-of-the-art approaches of securing XML documents are based on a partial annotation of an XML tree with security labels which are later propagated to unlabeled nodes of th...
Nataliya Rassadko
ACL
2001
13 years 11 months ago
From Chunks to function-Argument Structure: A Similarity-Based Approach
Chunk parsing has focused on the recognition of partial constituent structures at the level of individual chunks. Little attention has been paid to the question of how such partia...
Sandra Kübler, Erhard W. Hinrichs
DAM
2008
88views more  DAM 2008»
13 years 10 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
COLT
2010
Springer
13 years 8 months ago
Robust Selective Sampling from Single and Multiple Teachers
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...
Ofer Dekel, Claudio Gentile, Karthik Sridharan
CVPR
2006
IEEE
15 years 9 days ago
Semi-Supervised Classification Using Linear Neighborhood Propagation
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
Fei Wang, Changshui Zhang, Helen C. Shen, Jingdong...