900 search results - page 46 / 180 » On Polynomial Time Computation over Unordered Structures |
144
click to vote
JMLR
2012
13 years 5 months ago
2012
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
127
Voted
SAGT
2009
Springer
15 years 9 months ago
2009
Springer
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...
134
click to vote
LATIN
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
124
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
128
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...