1952 search results - page 332 / 391 » Complete partitions of graphs |
156
click to vote
CORR
2012
Springer
14 years 7 days ago
2012
Springer
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
149
Voted
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Learning to cope with domain change has been known
as a challenging problem in many real-world applications.
This paper proposes a novel and efficient approach, named
domain ada...
261
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
142
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
148
click to vote
AIRWEB
2009
Springer
15 years 11 months ago
2009
Springer
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...