13706 search results - page 2471 / 2742 » Information Problems in Information Society |
203
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
177
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
241
click to vote
ICDT
2012
ACM
13 years 9 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
163
click to vote
COCO
2003
Springer
15 years 12 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
246
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We study the problem of object classification when training
and test classes are disjoint, i.e. no training examples of
the target classes are available. This setup has hardly be...