---
_id: '2010'
abstract:
- lang: eng
text: Many algorithms for inferring causality rely heavily on the faithfulness assumption.
The main justification for imposing this assumption is that the set of unfaithful
distributions has Lebesgue measure zero, since it can be seen as a collection
of hypersurfaces in a hypercube. However, due to sampling error the faithfulness
condition alone is not sufficient for statistical estimation, and strong-faithfulness
has been proposed and assumed to achieve uniform or high-dimensional consistency.
In contrast to the plain faithfulness assumption, the set of distributions that
is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly
large as we show in this paper. We study the strong-faithfulness condition from
a geometric and combinatorial point of view and give upper and lower bounds on
the Lebesgue measure of strong-faithful distributions for various classes of directed
acyclic graphs. Our results imply fundamental limitations for the PC-algorithm
and potentially also for other algorithms based on partial correlation testing
in the Gaussian case.
arxiv: 1
author:
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Garvesh
full_name: Raskutti, Garvesh
last_name: Raskutti
- first_name: Peter
full_name: Bühlmann, Peter
last_name: Bühlmann
- first_name: Bin
full_name: Yu, Bin
last_name: Yu
citation:
ama: Uhler C, Raskutti G, Bühlmann P, Yu B. Geometry of the faithfulness assumption
in causal inference. The Annals of Statistics. 2013;41(2):436-463. doi:10.1214/12-AOS1080
apa: Uhler, C., Raskutti, G., Bühlmann, P., & Yu, B. (2013). Geometry of the
faithfulness assumption in causal inference. The Annals of Statistics.
Institute of Mathematical Statistics. https://doi.org/10.1214/12-AOS1080
chicago: Uhler, Caroline, Garvesh Raskutti, Peter Bühlmann, and Bin Yu. “Geometry
of the Faithfulness Assumption in Causal Inference.” The Annals of Statistics.
Institute of Mathematical Statistics, 2013. https://doi.org/10.1214/12-AOS1080.
ieee: C. Uhler, G. Raskutti, P. Bühlmann, and B. Yu, “Geometry of the faithfulness
assumption in causal inference,” The Annals of Statistics, vol. 41, no.
2. Institute of Mathematical Statistics, pp. 436–463, 2013.
ista: Uhler C, Raskutti G, Bühlmann P, Yu B. 2013. Geometry of the faithfulness
assumption in causal inference. The Annals of Statistics. 41(2), 436–463.
mla: Uhler, Caroline, et al. “Geometry of the Faithfulness Assumption in Causal
Inference.” The Annals of Statistics, vol. 41, no. 2, Institute of Mathematical
Statistics, 2013, pp. 436–63, doi:10.1214/12-AOS1080.
short: C. Uhler, G. Raskutti, P. Bühlmann, B. Yu, The Annals of Statistics 41 (2013)
436–463.
date_created: 2018-12-11T11:55:11Z
date_published: 2013-04-01T00:00:00Z
date_updated: 2021-01-12T06:54:42Z
day: '01'
department:
- _id: CaUh
doi: 10.1214/12-AOS1080
external_id:
arxiv:
- '1207.0547'
intvolume: ' 41'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: www.doi.org/10.1214/12-AOS1080
month: '04'
oa: 1
oa_version: Published Version
page: 436 - 463
publication: The Annals of Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5066'
quality_controlled: '1'
scopus_import: 1
status: public
title: Geometry of the faithfulness assumption in causal inference
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 41
year: '2013'
...
---
_id: '2181'
abstract:
- lang: eng
text: 'There is a trade-off between performance and correctness in implementing
concurrent data structures. Better performance may be achieved at the expense
of relaxing correctness, by redefining the semantics of data structures. We address
such a redefinition of data structure semantics and present a systematic and formal
framework for obtaining new data structures by quantitatively relaxing existing
ones. We view a data structure as a sequential specification S containing all
"legal" sequences over an alphabet of method calls. Relaxing the data
structure corresponds to defining a distance from any sequence over the alphabet
to the sequential specification: the k-relaxed sequential specification contains
all sequences over the alphabet within distance k from the original specification.
In contrast to other existing work, our relaxations are semantic (distance in
terms of data structure states). As an instantiation of our framework, we present
two simple yet generic relaxation schemes, called out-of-order and stuttering
relaxation, along with several ways of computing distances. We show that the out-of-order
relaxation, when further instantiated to stacks, queues, and priority queues,
amounts to tolerating bounded out-of-order behavior, which cannot be captured
by a purely syntactic relaxation (distance in terms of sequence manipulation,
e.g. edit distance). We give concurrent implementations of relaxed data structures
and demonstrate that bounded relaxations provide the means for trading correctness
for performance in a controlled way. The relaxations are monotonic which further
highlights the trade-off: increasing k increases the number of permitted sequences,
which as we demonstrate can lead to better performance. Finally, since a relaxed
stack or queue also implements a pool, we actually have new concurrent pool implementations
that outperform the state-of-the-art ones.'
acknowledgement: ' and an Elise Richter Fellowship (Austrian Science Fund V00125). '
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Hannes
full_name: Payer, Hannes
last_name: Payer
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
citation:
ama: 'Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation
of concurrent data structures. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Language. ACM; 2013:317-328. doi:10.1145/2429069.2429109'
apa: 'Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., & Sokolova, A. (2013).
Quantitative relaxation of concurrent data structures. In Proceedings of the
40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language
(pp. 317–328). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429109'
chicago: Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana
Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In Proceedings
of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language,
317–28. ACM, 2013. https://doi.org/10.1145/2429069.2429109.
ieee: T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative
relaxation of concurrent data structures,” in Proceedings of the 40th annual
ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome,
Italy, 2013, pp. 317–328.
ista: 'Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative
relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT
symposium on Principles of programming language. POPL: Principles of Programming
Languages, 317–328.'
mla: Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.”
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of
Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109.
short: T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings
of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language,
ACM, 2013, pp. 317–328.
conference:
end_date: 2013-01-25
location: Rome, Italy
name: 'POPL: Principles of Programming Languages'
start_date: 2013-01-23
date_created: 2018-12-11T11:56:11Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-02-21T16:06:49Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1145/2429069.2429109
ec_funded: 1
file:
- access_level: open_access
checksum: adf465e70948f4e80e48057524516456
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:33Z
date_updated: 2020-07-14T12:45:31Z
file_id: '5086'
file_name: IST-2014-198-v1+1_popl128-henzinger-clean.pdf
file_size: 294689
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 317 - 328
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles
of programming language
publication_identifier:
isbn:
- 978-1-4503-1832-7
publication_status: published
publisher: ACM
publist_id: '4801'
pubrep_id: '198'
quality_controlled: '1'
related_material:
record:
- id: '10901'
relation: later_version
status: deleted
scopus_import: 1
status: public
title: Quantitative relaxation of concurrent data structures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2182'
abstract:
- lang: eng
text: We propose a general framework for abstraction with respect to quantitative
properties, such as worst-case execution time, or power consumption. Our framework
provides a systematic way for counter-example guided abstraction refinement for
quantitative properties. The salient aspect of the framework is that it allows
anytime verification, that is, verification algorithms that can be stopped at
any time (for example, due to exhaustion of memory), and report approximations
that improve monotonically when the algorithms are given more time. We instantiate
the framework with a number of quantitative abstractions and refinement schemes,
which differ in terms of how much quantitative information they keep from the
original system. We introduce both state-based and trace-based quantitative abstractions,
and we describe conditions that define classes of quantitative properties for
which the abstractions provide over-approximations. We give algorithms for evaluating
the quantitative properties on the abstract systems. We present algorithms for
counter-example based refinements for quantitative properties for both state-based
and segment-based abstractions. We perform a case study on worst-case execution
time of executables to evaluate the anytime verification aspect and the quantitative
abstractions we proposed.
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: 'Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement.
In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles
of Programming Language. ACM; 2013:115-128. doi:10.1145/2429069.2429085'
apa: 'Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction
refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium
on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085'
chicago: Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative
Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085.
ieee: P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction
refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium
on Principles of programming language, Rome, Italy, 2013, pp. 115–128.
ista: 'Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement.
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming
language. POPL: Principles of Programming Languages, 115–128.'
mla: Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” Proceedings
of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language,
ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085.
short: P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013,
pp. 115–128.
conference:
end_date: 2013-01-25
location: Rome, Italy
name: 'POPL: Principles of Programming Languages'
start_date: 2013-07-23
date_created: 2018-12-11T11:56:11Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:50Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2429069.2429085
ec_funded: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 115 - 128
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles
of programming language
publication_status: published
publisher: ACM
publist_id: '4800'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantitative abstraction refinement
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2209'
abstract:
- lang: eng
text: "A straight skeleton is a well-known geometric structure, and several algorithms
exist to construct the straight skeleton for a given polygon or planar straight-line
graph. In this paper, we ask the reverse question: Given the straight skeleton
(in form of a planar straight-line graph, with some rays to infinity), can we
reconstruct a planar straight-line graph for which this was the straight skeleton?
We show how to reduce this problem to the problem of finding a line that intersects
a set of convex polygons. We can find these convex polygons and all such lines
in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number
of edges of the input graph. We also explain how our approach can be used for
recognizing Voronoi diagrams of points, thereby completing a partial solution
provided by Ash and Bolker in 1985.\r\n"
alternative_title:
- '2013 10th International Symposium on Voronoi Diagrams in Science and Engineering
(ISVD 2013) '
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
citation:
ama: 'Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams
and reconstructing their input. In: IEEE; 2013:37-46. doi:10.1109/ISVD.2013.11'
apa: 'Biedl, T., Held, M., & Huber, S. (2013). Recognizing straight skeletons
and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at
the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia:
IEEE. https://doi.org/10.1109/ISVD.2013.11'
chicago: Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons
and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. https://doi.org/10.1109/ISVD.2013.11.
ieee: 'T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi
diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams
in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.'
ista: 'Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi
diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and
Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science
and Engineering (ISVD 2013) , , 37–46.'
mla: Biedl, Therese, et al. Recognizing Straight Skeletons and Voronoi Diagrams
and Reconstructing Their Input. IEEE, 2013, pp. 37–46, doi:10.1109/ISVD.2013.11.
short: T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46.
conference:
end_date: 2013-07-10
location: St. Petersburg, Russia
name: 'ISVD: Voronoi Diagrams in Science and Engineering'
start_date: 2013-07-08
date_created: 2018-12-11T11:56:20Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2021-01-12T06:56:00Z
day: '01'
department:
- _id: HeEd
doi: 10.1109/ISVD.2013.11
language:
- iso: eng
month: '12'
oa_version: None
page: 37 - 46
publication_identifier:
eisbn:
- '978-0-7695-5037-4 '
publication_status: published
publisher: IEEE
publist_id: '4763'
quality_controlled: '1'
scopus_import: 1
status: public
title: Recognizing straight skeletons and Voronoi diagrams and reconstructing their
input
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2210'
abstract:
- lang: eng
text: 'A straight skeleton is a well-known geometric structure, and several algorithms
exist to construct the straight skeleton for a given polygon. In this paper, we
ask the reverse question: Given the straight skeleton (in form of a tree with
a drawing in the plane, but with the exact position of the leaves unspecified),
can we reconstruct the polygon? We show that in most cases there exists at most
one polygon; in the remaining case there is an infinite number of polygons determined
by one angle that can range in an interval. We can find this (set of) polygon(s)
in linear time in the Real RAM computer model.'
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
citation:
ama: 'Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons.
In: 29th European Workshop on Computational Geometry. TU Braunschweig;
2013:95-98.'
apa: 'Biedl, T., Held, M., & Huber, S. (2013). Reconstructing polygons from
embedded straight skeletons. In 29th European Workshop on Computational Geometry
(pp. 95–98). Braunschweig, Germany: TU Braunschweig.'
chicago: Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons
from Embedded Straight Skeletons.” In 29th European Workshop on Computational
Geometry, 95–98. TU Braunschweig, 2013.
ieee: T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight
skeletons,” in 29th European Workshop on Computational Geometry, Braunschweig,
Germany, 2013, pp. 95–98.
ista: 'Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight
skeletons. 29th European Workshop on Computational Geometry. EuroCG: European
Workshop on Computational Geometry, 95–98.'
mla: Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.”
29th European Workshop on Computational Geometry, TU Braunschweig, 2013,
pp. 95–98.
short: T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational
Geometry, TU Braunschweig, 2013, pp. 95–98.
conference:
end_date: 2013-03-20
location: Braunschweig, Germany
name: 'EuroCG: European Workshop on Computational Geometry'
start_date: 2013-03-17
date_created: 2018-12-11T11:56:21Z
date_published: 2013-03-01T00:00:00Z
date_updated: 2021-01-12T06:56:00Z
day: '01'
department:
- _id: HeEd
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf
month: '03'
oa: 1
oa_version: Submitted Version
page: 95 - 98
publication: 29th European Workshop on Computational Geometry
publication_status: published
publisher: TU Braunschweig
publist_id: '4762'
status: public
title: Reconstructing polygons from embedded straight skeletons
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2237'
abstract:
- lang: eng
text: We describe new extensions of the Vampire theorem prover for computing tree
interpolants. These extensions generalize Craig interpolation in Vampire, and
can also be used to derive sequence interpolants. We evaluated our implementation
on a large number of examples over the theory of linear integer arithmetic and
integer-indexed arrays, with and without quantifiers. When compared to other methods,
our experiments show that some examples could only be solved by our implementation.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Régis
full_name: Blanc, Régis
last_name: Blanc
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Laura
full_name: Kovács, Laura
last_name: Kovács
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
citation:
ama: Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181.
doi:10.1007/978-3-642-45221-5_13
apa: 'Blanc, R., Gupta, A., Kovács, L., & Kragl, B. (2013). Tree interpolation
in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence,
and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_13'
chicago: Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation
in Vampire.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_13.
ieee: R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,”
vol. 8312. Springer, pp. 173–181, 2013.
ista: Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire.
8312, 173–181.
mla: Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer,
2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13.
short: R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.
conference:
end_date: 2013-12-19
location: Stellenbosch, South Africa
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2013-12-14
date_created: 2018-12-11T11:56:29Z
date_published: 2013-01-14T00:00:00Z
date_updated: 2020-08-11T10:09:42Z
day: '14'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-45221-5_13
file:
- access_level: open_access
checksum: 9cebaafca032e6769d273f393305c705
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T11:10:40Z
date_updated: 2020-07-14T12:45:34Z
file_id: '7858'
file_name: 2013_LPAR_Blanc.pdf
file_size: 279206
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 8312'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 173 - 181
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '4724'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Tree interpolation in Vampire
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8312
year: '2013'
...
---
_id: '2238'
abstract:
- lang: eng
text: "We study the problem of achieving a given value in Markov decision processes
(MDPs) with several independent discounted reward objectives. We consider a generalised
version of discounted reward objectives, in which the amount of discounting depends
on the states visited and on the objective. This definition extends the usual
definition of discounted reward, and allows to capture the systems in which the
value of different commodities diminish at different and variable rates.\r\n\r\nWe
establish results for two prominent subclasses of the problem, namely state-discount
models where the discount factors are only dependent on the state of the MDP (and
independent of the objective), and reward-discount models where they are only
dependent on the objective (but not on the state of the MDP). For the state-discount
models we use a straightforward reduction to expected total reward and show that
the problem whether a value is achievable can be solved in polynomial time. For
the reward-discount model we show that memory and randomisation of the strategies
are required, but nevertheless that the problem is decidable and it is sufficient
to consider strategies which after a certain number of steps behave in a memoryless
way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e.
MDPs with no randomisation), pure strategies and discount factors of the form
1/n where n is an integer, the problem is in PSPACE and finite memory suffices
for achieving a given value. We also show that when the discount factors are not
of the form 1/n, the memory required by a strategy can be infinite.\r\n"
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Dominik
full_name: Wojtczak, Dominik
last_name: Wojtczak
citation:
ama: Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification
in graphs and MDPs. 2013;8312:228-242. doi:10.1007/978-3-642-45221-5_17
apa: 'Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted
reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming,
Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer.
https://doi.org/10.1007/978-3-642-45221-5_17'
chicago: Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective
Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer
Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_17.
ieee: K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward
verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.
ista: Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward
verification in graphs and MDPs. 8312, 228–242.
mla: Chatterjee, Krishnendu, et al. Multi-Objective Discounted Reward Verification
in Graphs and MDPs. Vol. 8312, Springer, 2013, pp. 228–42, doi:10.1007/978-3-642-45221-5_17.
short: K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.
conference:
end_date: 2013-12-19
location: Stellenbosch, South Africa
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2013-12-14
date_created: 2018-12-11T11:56:30Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2020-08-11T10:09:42Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-45221-5_17
ec_funded: 1
intvolume: ' 8312'
language:
- iso: eng
month: '12'
oa_version: None
page: 228 - 242
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '4723'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Multi-objective discounted reward verification in graphs and MDPs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8312
year: '2013'
...
---
_id: '2243'
abstract:
- lang: eng
text: We show that modal logic over universally first-order definable classes of
transitive frames is decidable. More precisely, let K be an arbitrary class of
transitive Kripke frames definable by a universal first-order sentence. We show
that the global and finite global satisfiability problems of modal logic over
K are decidable in NP, regardless of choice of K. We also show that the local
satisfiability and the finite local satisfiability problems of modal logic over
K are decidable in NEXPTIME.
alternative_title:
- LIPIcs
author:
- first_name: Jakub
full_name: Michaliszyn, Jakub
last_name: Michaliszyn
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Michaliszyn J, Otop J. Elementary modal logics over transitive structures.
2013;23:563-577. doi:10.4230/LIPIcs.CSL.2013.563
apa: 'Michaliszyn, J., & Otop, J. (2013). Elementary modal logics over transitive
structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.563'
chicago: Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive
Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.563.
ieee: J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,”
vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.
ista: Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures.
23, 563–577.
mla: Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive
Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013,
pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563.
short: J. Michaliszyn, J. Otop, 23 (2013) 563–577.
conference:
end_date: 2013-09-05
location: Torino, Italy
name: 'CSL: Computer Science Logic'
start_date: 2013-09-02
date_created: 2018-12-11T11:56:32Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2020-08-11T10:09:42Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CSL.2013.563
ec_funded: 1
file:
- access_level: open_access
checksum: e0732e73a8b1e39483df7717d53e3e35
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:11Z
date_updated: 2020-07-14T12:45:34Z
file_id: '4929'
file_name: IST-2016-136-v1+2_39.pdf
file_size: 454915
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 23'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 563 - 577
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4708'
pubrep_id: '136'
quality_controlled: '1'
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: Elementary modal logics over transitive structures
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...
---
_id: '2244'
abstract:
- lang: eng
text: 'We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a
compact two-dimensional surface ℳ with boundary. Each αi and each βj is either
an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The
αi are pairwise disjoint except for possibly sharing endpoints, and similarly
for the βj. We want to "untangle" the βj from the αi by a self-homeomorphism
of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of
ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is
as small as possible. This problem is motivated by an application in the algorithmic
theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere
with h ≥ 0 boundary components ("holes"), then O(mn) crossings can be
achieved (independently of h), which is asymptotically tight, as an easy lower
bound shows. In general, for an arbitrary (orientable or nonorientable) surface
ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an
O((m + n)4) upper bound, again independent of h and g. '
acknowledgement: We would like to thank the authors of [GHR13] for mak- ing a draft
of their paper available to us, and, in particular, T. Huynh for an e-mail correspondence.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Eric
full_name: Sedgwick, Eric
last_name: Sedgwick
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing
curves. 2013;8242:472-483. doi:10.1007/978-3-319-03841-4_41
apa: 'Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2013). Untangling
two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network
Visualization, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-319-03841-4_41'
chicago: Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling
Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-319-03841-4_41.
ieee: J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems
of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.
ista: Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of
noncrossing curves. 8242, 472–483.
mla: Matoušek, Jiří, et al. Untangling Two Systems of Noncrossing Curves.
Vol. 8242, Springer, 2013, pp. 472–83, doi:10.1007/978-3-319-03841-4_41.
short: J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.
conference:
end_date: 2013-09-25
location: Bordeaux, France
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2013-09-23
date_created: 2018-12-11T11:56:32Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2023-02-21T17:03:07Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/978-3-319-03841-4_41
external_id:
arxiv:
- '1302.6475'
intvolume: ' 8242'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1302.6475
month: '09'
oa: 1
oa_version: Preprint
page: 472 - 483
project:
- _id: 25FA3206-B435-11E9-9278-68D0E5697425
grant_number: PP00P2_138948
name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics'
publication_status: published
publisher: Springer
publist_id: '4707'
quality_controlled: '1'
related_material:
record:
- id: '1411'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Untangling two systems of noncrossing curves
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8242
year: '2013'
...
---
_id: '2247'
abstract:
- lang: eng
text: Cooperative behavior, where one individual incurs a cost to help another,
is a wide spread phenomenon. Here we study direct reciprocity in the context of
the alternating Prisoner's Dilemma. We consider all strategies that can be implemented
by one and two-state automata. We calculate the payoff matrix of all pairwise
encounters in the presence of noise. We explore deterministic selection dynamics
with and without mutation. Using different error rates and payoff values, we observe
convergence to a small number of distinct equilibria. Two of them are uncooperative
strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium
is mixed and represents a cooperative alliance of several strategies, dominated
by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent
has cooperated; it defects once when the opponent has defected, but subsequently
Forgiver attempts to re-establish cooperation even if the opponent has defected
again. Forgiver is not an evolutionarily stable strategy, but the alliance, which
it rules, is asymptotically stable. For a wide range of parameter values the most
commonly observed outcome is convergence to the mixed equilibrium, dominated by
Forgiver. Our results show that although forgiving might incur a short-term loss
it can lead to a long-term gain. Forgiveness facilitates stable cooperation in
the presence of exploitation and noise.
article_number: e80814
author:
- first_name: Benjamin
full_name: Zagorsky, Benjamin
last_name: Zagorsky
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating
prisoner’s dilemma . PLoS One. 2013;8(12). doi:10.1371/journal.pone.0080814
apa: Zagorsky, B., Reiter, J., Chatterjee, K., & Nowak, M. (2013). Forgiver
triumphs in alternating prisoner’s dilemma . PLoS One. Public Library of
Science. https://doi.org/10.1371/journal.pone.0080814
chicago: Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin
Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” PLoS One.
Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0080814.
ieee: B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in
alternating prisoner’s dilemma ,” PLoS One, vol. 8, no. 12. Public Library
of Science, 2013.
ista: Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating
prisoner’s dilemma . PLoS One. 8(12), e80814.
mla: Zagorsky, Benjamin, et al. “Forgiver Triumphs in Alternating Prisoner’s Dilemma
.” PLoS One, vol. 8, no. 12, e80814, Public Library of Science, 2013, doi:10.1371/journal.pone.0080814.
short: B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).
date_created: 2018-12-11T11:56:33Z
date_published: 2013-12-12T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '12'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1371/journal.pone.0080814
ec_funded: 1
file:
- access_level: open_access
checksum: 808e8b9e6e89658bee4ffbbfac1bd19d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:15Z
date_updated: 2020-07-14T12:45:34Z
file_id: '4868'
file_name: IST-2016-409-v1+1_journal.pone.0080814.pdf
file_size: 1050042
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4702'
pubrep_id: '409'
quality_controlled: '1'
related_material:
record:
- id: '9749'
relation: research_data
status: public
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: 'Forgiver triumphs in alternating prisoner''s dilemma '
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2013'
...
---
_id: '2256'
abstract:
- lang: eng
text: Linked (Open) Data - bibliographic data on the Semantic Web. Report of the
Working Group on Linked Data to the plenary assembly of the Austrian Library Network
(translation of the title). Linked Data stands for a certain approach to publishing
data on the Web. The underlying idea is to harmonise heterogeneous data sources
of different origin in order to improve their accessibility and interoperability,
effectively making them queryable as a big distributed database. This report summarises
relevant developments in Europe as well as the Linked Data Working Group‘s strategic
and technical considerations regarding the publishing of the Austrian Library
Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement
that the implementation of Linked Data principles within the OBV can only be taken
into consideration accompanied by a discussion about the provision of the datasets
under a free license.
- lang: ger
text: "Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten
via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz,
die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst
\r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit
abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen
Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich
der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes
(OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung
von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über
die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht
werden sollte."
author:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Doron
full_name: Goldfarb, Doron
last_name: Goldfarb
- first_name: Verena
full_name: Schaffner, Verena
last_name: Schaffner
- first_name: Wolfram
full_name: Seidler, Wolfram
last_name: Seidler
citation:
ama: Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische
Daten im Semantic Web. VÖB Mitteilungen. 2013;66(3/4):559-587.
apa: Danowski, P., Goldfarb, D., Schaffner, V., & Seidler, W. (2013). Linked
(Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen.
Verein Österreichischer Bibliothekarinnen und Bibliothekare.
chicago: Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler.
“Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen.
Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013.
ieee: P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data
- Bibliographische Daten im Semantic Web,” VÖB Mitteilungen, vol. 66, no.
3/4. Verein Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587,
2013.
ista: Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data -
Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587.
mla: Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic
Web.” VÖB Mitteilungen, vol. 66, no. 3/4, Verein Österreichischer Bibliothekarinnen
und Bibliothekare, 2013, pp. 559–87.
short: P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013)
559–587.
date_created: 2018-12-11T11:56:36Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2021-01-12T06:56:20Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: ae57ffcee3720adcc27b0f2767a1e04b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:09Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4669'
file_name: IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf
file_size: 881545
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 66'
issue: 3/4
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 559 - 587
popular_science: '1'
publication: VÖB Mitteilungen
publication_status: published
publisher: Verein Österreichischer Bibliothekarinnen und Bibliothekare
publist_id: '4690'
pubrep_id: '719'
status: public
title: Linked (Open) Data - Bibliographische Daten im Semantic Web
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2013'
...
---
_id: '2258'
abstract:
- lang: eng
text: "In a digital signature scheme with message recovery, rather than transmitting
the message m and its signature σ, a single enhanced signature τ is transmitted.
The verifier is able to recover m from τ and at the same time verify its authenticity.
The two most important parameters of such a scheme are its security and overhead
|τ| − |m|. A simple argument shows that for any scheme with “n bits security”
|τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n.
Currently, the best known constructions in the random oracle model are far from
this lower bound requiring an overhead of n + logq h , where q h is the number
of queries to the random oracle. In this paper we give a construction which basically
matches the n bit lower bound. We propose a simple digital signature scheme with
n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.\r\n\r\nOur
construction works in two steps. First, we propose a signature scheme with message
recovery having optimal overhead in a new ideal model, the random invertible function
model. Second, we show that a four-round Feistel network with random oracles as
round functions is tightly “public-indifferentiable” from a random invertible
function. At the core of our indifferentiability proof is an almost tight upper
bound for the expected number of edges of the densest “small” subgraph of a random
Cayley graph, which may be of independent interest.\r\n"
alternative_title:
- LNCS
author:
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Mario
full_name: Szegedy, Mario
last_name: Szegedy
citation:
ama: Kiltz E, Pietrzak KZ, Szegedy M. Digital signatures with minimal overhead from
indifferentiable random invertible functions. 2013;8042:571-588. doi:10.1007/978-3-642-40041-4_31
apa: 'Kiltz, E., Pietrzak, K. Z., & Szegedy, M. (2013). Digital signatures with
minimal overhead from indifferentiable random invertible functions. Presented
at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United
States: Springer. https://doi.org/10.1007/978-3-642-40041-4_31'
chicago: Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures
with Minimal Overhead from Indifferentiable Random Invertible Functions.” Lecture
Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_31.
ieee: E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal
overhead from indifferentiable random invertible functions,” vol. 8042. Springer,
pp. 571–588, 2013.
ista: Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead
from indifferentiable random invertible functions. 8042, 571–588.
mla: Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable
Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31.
short: E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.
conference:
end_date: 2013-08-22
location: Santa Barbara, CA, United States
name: 'CRYPTO: International Cryptology Conference'
start_date: 2013-08-18
date_created: 2018-12-11T11:56:37Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:21Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-642-40041-4_31
ec_funded: 1
file:
- access_level: open_access
checksum: 18a3f602cb41de184dc0e16a0e907633
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:20Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4744'
file_name: IST-2016-685-v1+1_658.pdf
file_size: 493175
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 8042'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 571 - 588
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '4688'
pubrep_id: '685'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Digital signatures with minimal overhead from indifferentiable random invertible
functions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8042
year: '2013'
...
---
_id: '2259'
abstract:
- lang: eng
text: "The learning with rounding (LWR) problem, introduced by Banerjee, Peikert
and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where
one replaces random errors with deterministic rounding. The LWR problem was shown
to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error
ratio are super-polynomial. In this work we resolve the main open problem and
give a new reduction that works for a larger range of parameters, allowing for
a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus
gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater
security, which now follows from the worst-case hardness of GapSVP with polynomial
(rather than super-polynomial) approximation factors.\r\n\r\nAs a tool in the
reduction, we show that there is a “lossy mode” for the LWR problem, in which
LWR samples only reveal partial information about the secret. This property gives
us several interesting new applications, including a proof that LWR remains secure
with weakly random secrets of sufficient min-entropy, and very simple constructions
of deterministic encryption, lossy trapdoor functions and reusable extractors.\r\n\r\nOur
approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly
showed the existence of a “lossy mode” for LWE. By refining this technique, we
also improve on the parameters of that work to only requiring a polynomial (instead
of super-polynomial) modulus and modulus-to-error ratio.\r\n"
alternative_title:
- LNCS
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Stephan
full_name: Krenn, Stephan
id: 329FCCF0-F248-11E8-B48F-1D18A9856A87
last_name: Krenn
orcid: 0000-0003-2835-9093
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited:
New reduction properties and applications. 2013;8042(1):57-74. doi:10.1007/978-3-642-40041-4_4'
apa: 'Alwen, J. F., Krenn, S., Pietrzak, K. Z., & Wichs, D. (2013). Learning
with rounding, revisited: New reduction properties and applications. Presented
at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United
States: Springer. https://doi.org/10.1007/978-3-642-40041-4_4'
chicago: 'Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs.
“Learning with Rounding, Revisited: New Reduction Properties and Applications.”
Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_4.'
ieee: 'J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding,
revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer,
pp. 57–74, 2013.'
ista: 'Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited:
New reduction properties and applications. 8042(1), 57–74.'
mla: 'Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction
Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74,
doi:10.1007/978-3-642-40041-4_4.'
short: J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
conference:
end_date: 2013-08-22
location: Santa Barbara, CA, United States
name: 'CRYPTO: International Cryptology Conference'
start_date: 2013-08-18
date_created: 2018-12-11T11:56:37Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:21Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-642-40041-4_4
ec_funded: 1
file:
- access_level: open_access
checksum: 16d428408a806b8e49eecc607deab115
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:55Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4912'
file_name: IST-2016-684-v1+1_098.pdf
file_size: 587898
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 8042'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 57 - 74
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '4687'
pubrep_id: '684'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'Learning with rounding, revisited: New reduction properties and applications'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8042
year: '2013'
...
---
_id: '2260'
abstract:
- lang: eng
text: "Direct Anonymous Attestation (DAA) is one of the most complex cryptographic
protocols deployed in practice. It allows an embedded secure processor known as
a Trusted Platform Module (TPM) to attest to the configuration of its host computer
without violating the owner’s privacy. DAA has been standardized by the Trusted
Computing Group and ISO/IEC.\r\n\r\nThe security of the DAA standard and all existing
schemes is analyzed in the random-oracle model. We provide the first constructions
of DAA in the standard model, that is, without relying on random oracles. Our
constructions use new building blocks, including the first efficient signatures
of knowledge in the standard model, which have many applications beyond DAA.\r\n"
alternative_title:
- LNCS
author:
- first_name: David
full_name: Bernhard, David
last_name: Bernhard
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Essam
full_name: Ghadafi, Essam
last_name: Ghadafi
citation:
ama: Bernhard D, Fuchsbauer G, Ghadafi E. Efficient signatures of knowledge and
DAA in the standard model. 2013;7954:518-533. doi:10.1007/978-3-642-38980-1_33
apa: 'Bernhard, D., Fuchsbauer, G., & Ghadafi, E. (2013). Efficient signatures
of knowledge and DAA in the standard model. Presented at the ACNS: Applied Cryptography
and Network Security, Banff, AB, Canada: Springer. https://doi.org/10.1007/978-3-642-38980-1_33'
chicago: Bernhard, David, Georg Fuchsbauer, and Essam Ghadafi. “Efficient Signatures
of Knowledge and DAA in the Standard Model.” Lecture Notes in Computer Science.
Springer, 2013. https://doi.org/10.1007/978-3-642-38980-1_33.
ieee: D. Bernhard, G. Fuchsbauer, and E. Ghadafi, “Efficient signatures of knowledge
and DAA in the standard model,” vol. 7954. Springer, pp. 518–533, 2013.
ista: Bernhard D, Fuchsbauer G, Ghadafi E. 2013. Efficient signatures of knowledge
and DAA in the standard model. 7954, 518–533.
mla: Bernhard, David, et al. Efficient Signatures of Knowledge and DAA in the
Standard Model. Vol. 7954, Springer, 2013, pp. 518–33, doi:10.1007/978-3-642-38980-1_33.
short: D. Bernhard, G. Fuchsbauer, E. Ghadafi, 7954 (2013) 518–533.
conference:
end_date: 2013-06-28
location: Banff, AB, Canada
name: 'ACNS: Applied Cryptography and Network Security'
start_date: 2013-06-25
date_created: 2018-12-11T11:56:37Z
date_published: 2013-06-01T00:00:00Z
date_updated: 2020-08-11T10:09:44Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-642-38980-1_33
intvolume: ' 7954'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2012/475
month: '06'
oa: 1
oa_version: Submitted Version
page: 518 - 533
publication_status: published
publisher: Springer
publist_id: '4686'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Efficient signatures of knowledge and DAA in the standard model
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7954
year: '2013'
...
---
_id: '2264'
abstract:
- lang: eng
text: Faithful progression through the cell cycle is crucial to the maintenance
and developmental potential of stem cells. Here, we demonstrate that neural stem
cells (NSCs) and intermediate neural progenitor cells (NPCs) employ a zinc-finger
transcription factor specificity protein 2 (Sp2) as a cell cycle regulator in
two temporally and spatially distinct progenitor domains. Differential conditional
deletion of Sp2 in early embryonic cerebral cortical progenitors, and perinatal
olfactory bulb progenitors disrupted transitions through G1, G2 and M phases,
whereas DNA synthesis appeared intact. Cell-autonomous function of Sp2 was identified
by deletion of Sp2 using mosaic analysis with double markers, which clearly established
that conditional Sp2-null NSCs and NPCs are M phase arrested in vivo. Importantly,
conditional deletion of Sp2 led to a decline in the generation of NPCs and neurons
in the developing and postnatal brains. Our findings implicate Sp2-dependent mechanisms
as novel regulators of cell cycle progression, the absence of which disrupts neurogenesis
in the embryonic and postnatal brain.
article_processing_charge: No
author:
- first_name: Huixuan
full_name: Liang, Huixuan
last_name: Liang
- first_name: Guanxi
full_name: Xiao, Guanxi
last_name: Xiao
- first_name: Haifeng
full_name: Yin, Haifeng
last_name: Yin
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Jonathan
full_name: Horowitz, Jonathan
last_name: Horowitz
- first_name: Troy
full_name: Ghashghaei, Troy
last_name: Ghashghaei
citation:
ama: Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. Neural development
is dependent on the function of specificity protein 2 in cell cycle progression.
Development. 2013;140(3):552-561. doi:10.1242/dev.085621
apa: Liang, H., Xiao, G., Yin, H., Hippenmeyer, S., Horowitz, J., & Ghashghaei,
T. (2013). Neural development is dependent on the function of specificity protein
2 in cell cycle progression. Development. Company of Biologists. https://doi.org/10.1242/dev.085621
chicago: Liang, Huixuan, Guanxi Xiao, Haifeng Yin, Simon Hippenmeyer, Jonathan Horowitz,
and Troy Ghashghaei. “Neural Development Is Dependent on the Function of Specificity
Protein 2 in Cell Cycle Progression.” Development. Company of Biologists,
2013. https://doi.org/10.1242/dev.085621.
ieee: H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, and T. Ghashghaei,
“Neural development is dependent on the function of specificity protein 2 in cell
cycle progression,” Development, vol. 140, no. 3. Company of Biologists,
pp. 552–561, 2013.
ista: Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. 2013. Neural
development is dependent on the function of specificity protein 2 in cell cycle
progression. Development. 140(3), 552–561.
mla: Liang, Huixuan, et al. “Neural Development Is Dependent on the Function of
Specificity Protein 2 in Cell Cycle Progression.” Development, vol. 140,
no. 3, Company of Biologists, 2013, pp. 552–61, doi:10.1242/dev.085621.
short: H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, T. Ghashghaei, Development
140 (2013) 552–561.
date_created: 2018-12-11T11:56:39Z
date_published: 2013-02-01T00:00:00Z
date_updated: 2021-01-12T06:56:23Z
day: '01'
department:
- _id: SiHi
doi: 10.1242/dev.085621
external_id:
pmid:
- '23293287'
intvolume: ' 140'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3561788/
month: '02'
oa: 1
oa_version: Submitted Version
page: 552 - 561
pmid: 1
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '4681'
quality_controlled: '1'
scopus_import: 1
status: public
title: Neural development is dependent on the function of specificity protein 2 in
cell cycle progression
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 140
year: '2013'
...
---
_id: '2270'
abstract:
- lang: eng
text: "Representation languages for coalitional games are a key research area in
algorithmic game theory. There is an inher-\r\nent tradeoff between how general
a language is, allowing it to capture more elaborate games, and how hard
\ it is computationally to optimize and solve such games. One prominent such
\ language is the simple yet expressive\r\nWeighted Graph Games (WGGs) representation
(Deng and Papadimitriou 1994), which maintains knowledge about synergies between
agents in the form of an edge weighted graph. We consider the problem of finding
\ the optimal coalition structure in WGGs. The agents in such games are vertices
in a graph, and the value of a coalition is the sum of the weights of the edges
present between coalition members. The optimal coalition structure is a partition
of the agents to coalitions, that maximizes the sum of utilities obtained by the
coalitions. We show that finding the optimal coalition structure is not
only hard for general graphs, but is also intractable for restricted families
such as planar graphs which are amenable for many other combinatorial problems.
\ We then provide algorithms with constant factor approximations for planar, minorfree
and bounded degree graphs."
arxiv: 1
author:
- first_name: Yoram
full_name: Bachrach, Yoram
last_name: Bachrach
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Morteza
full_name: Zadimoghaddam, Morteza
last_name: Zadimoghaddam
citation:
ama: 'Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. Optimal Coalition Structures
in Cooperative Graph Games. In: AAAI Press; 2013:81-87.'
apa: 'Bachrach, Y., Kohli, P., Kolmogorov, V., & Zadimoghaddam, M. (2013). Optimal
Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the
AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI
Press.'
chicago: Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam.
“Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press,
2013.
ieee: 'Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition
Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial
Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.'
ista: 'Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition
Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence,
81–87.'
mla: Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph
Games. AAAI Press, 2013, pp. 81–87.
short: Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press,
2013, pp. 81–87.
conference:
end_date: 2013-07-18
location: Bellevue, WA, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2013-07-14
date_created: 2018-12-11T11:56:41Z
date_published: 2013-12-31T00:00:00Z
date_updated: 2021-01-12T06:56:25Z
day: '31'
department:
- _id: VlKo
external_id:
arxiv:
- '1108.5248'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1108.5248
month: '12'
oa: 1
oa_version: None
page: 81-87
publication_status: published
publisher: AAAI Press
publist_id: '4674'
quality_controlled: '1'
status: public
title: Optimal Coalition Structures in Cooperative Graph Games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2272'
abstract:
- lang: eng
text: "We consider Conditional Random Fields (CRFs) with pattern-based potentials
defined on a chain. In this model the energy of a string (labeling) x1...xn is
the sum of terms over intervals [i,j] where each term is non-zero only if the
substring xi...xj equals a prespecified pattern α. Such CRFs can be naturally
applied to many sequence tagging problems.\r\nWe present efficient algorithms
for the three standard inference tasks in a CRF, namely computing (i) the partition
function, (ii) marginals, and (iii) computing the MAP. Their complexities are
respectively O(nL), O(nLℓmax) and O(nLmin{|D|,log(ℓmax+1)}) where L is the combined
length of input patterns, ℓmax is the maximum length of a pattern, and D is the
input alphabet. This improves on the previous algorithms of (Ye et al., 2009)
whose complexities are respectively O(nL|D|), O(n|Γ|L2ℓ2max) and O(nL|D|), where
|Γ| is the number of input patterns.\r\nIn addition, we give an efficient algorithm
for sampling. Finally, we consider the case of non-positive weights. (Komodakis
& Paragios, 2009) gave an O(nL) algorithm for computing the MAP. We present
a modification that has the same worst-case complexity but can beat it in the
best case. "
alternative_title:
- JMLR
article_processing_charge: No
author:
- first_name: Rustem
full_name: Takhanov, Rustem
id: 2CCAC26C-F248-11E8-B48F-1D18A9856A87
last_name: Takhanov
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Takhanov R, Kolmogorov V. Inference algorithms for pattern-based CRFs on sequence
data. In: ICML’13 Proceedings of the 30th International Conference on International.
Vol 28. ML Research Press; 2013:145-153.'
apa: 'Takhanov, R., & Kolmogorov, V. (2013). Inference algorithms for pattern-based
CRFs on sequence data. In ICML’13 Proceedings of the 30th International Conference
on International (Vol. 28, pp. 145–153). Atlanta, GA, USA: ML Research Press.'
chicago: Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based
CRFs on Sequence Data.” In ICML’13 Proceedings of the 30th International Conference
on International, 28:145–53. ML Research Press, 2013.
ieee: R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs
on sequence data,” in ICML’13 Proceedings of the 30th International Conference
on International, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153.
ista: 'Takhanov R, Kolmogorov V. 2013. Inference algorithms for pattern-based CRFs
on sequence data. ICML’13 Proceedings of the 30th International Conference on
International. ICML: International Conference on Machine Learning, JMLR, vol.
28, 145–153.'
mla: Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based
CRFs on Sequence Data.” ICML’13 Proceedings of the 30th International Conference
on International, vol. 28, no. 3, ML Research Press, 2013, pp. 145–53.
short: R. Takhanov, V. Kolmogorov, in:, ICML’13 Proceedings of the 30th International
Conference on International, ML Research Press, 2013, pp. 145–153.
conference:
end_date: 2013-06-21
location: Atlanta, GA, USA
name: 'ICML: International Conference on Machine Learning'
start_date: 2013-06-16
date_created: 2018-12-11T11:56:41Z
date_published: 2013-06-01T00:00:00Z
date_updated: 2023-10-17T09:51:32Z
day: '01'
department:
- _id: VlKo
intvolume: ' 28'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://proceedings.mlr.press/v28/takhanov13.pdf?CFID=105472548&CFTOKEN=5c5859b5d97b4439-27B4AC58-BA92-A964-B598CAACEE6CC515
month: '06'
oa: 1
oa_version: Submitted Version
page: 145 - 153
publication: ICML'13 Proceedings of the 30th International Conference on International
publication_status: published
publisher: ML Research Press
publist_id: '4672'
quality_controlled: '1'
related_material:
record:
- id: '1794'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Inference algorithms for pattern-based CRFs on sequence data
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2013'
...
---
_id: '2273'
abstract:
- lang: eng
text: We propose a new family of message passing techniques for MAP estimation in
graphical models which we call Sequential Reweighted Message Passing (SRMP). Special
cases include well-known techniques such as Min-Sum Diusion (MSD) and a faster
Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation
is simpler than the original derivation of TRW-S, and does not involve a decomposition
into trees. This allows easy generalizations. We present such a generalization
for the case of higher-order graphical models, and test it on several real-world
problems with promising results.
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. Reweighted Message Passing Revisited. IST Austria; 2013.
apa: Kolmogorov, V. (2013). Reweighted message passing revisited. IST Austria.
chicago: Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST
Austria, 2013.
ieee: V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.
ista: Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p.
mla: Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria,
2013.
short: V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.
date_created: 2018-12-11T11:56:42Z
date_published: 2013-09-22T00:00:00Z
date_updated: 2019-01-24T13:07:32Z
day: '22'
department:
- _id: VlKo
extern: 0
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5655
month: '09'
oa: 1
publication_status: published
publisher: IST Austria
publist_id: '4671'
quality_controlled: 0
status: public
title: Reweighted message passing revisited
type: report
year: '2013'
...
---
_id: '2274'
abstract:
- lang: eng
text: "Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto'92) as
protection to a shared resource. The basic idea is to ask the service requestor
to dedicate some non-trivial amount of computational work to every request. The
original applications included prevention of spam and protection against denial
of service attacks. More recently, PoWs have been used to prevent double spending
in the Bitcoin digital currency system.\r\n\r\nIn this work, we put forward an
alternative concept for PoWs -- so-called proofs of space (PoS), where a service
requestor must dedicate a significant amount of disk space as opposed to computation.
We construct secure PoS schemes in the random oracle model, using graphs with
high "pebbling complexity" and Merkle hash-trees. "
author:
- first_name: Stefan
full_name: Dziembowski, Stefan
last_name: Dziembowski
- first_name: Sebastian
full_name: Faust, Sebastian
last_name: Faust
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. Proofs of Space.
IST Austria; 2013.
apa: Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2013). Proofs
of Space. IST Austria.
chicago: Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof
Z Pietrzak. Proofs of Space. IST Austria, 2013.
ieee: S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of
Space. IST Austria, 2013.
ista: Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2013. Proofs of Space,
IST Austria,p.
mla: Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.
short: S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space,
IST Austria, 2013.
date_created: 2018-12-11T11:56:42Z
date_published: 2013-11-28T00:00:00Z
date_updated: 2023-02-23T10:09:33Z
day: '28'
ddc:
- '530'
department:
- _id: VlKo
- _id: KrPi
file:
- access_level: open_access
checksum: 37b61637b62fc079d9141c59d9f1a94f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:11Z
date_updated: 2020-07-14T12:45:36Z
file_id: '5197'
file_name: IST-2016-671-v1+1_796.pdf
file_size: 405870
relation: main_file
file_date_updated: 2020-07-14T12:45:36Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
publist_id: '4670'
pubrep_id: '671'
related_material:
record:
- id: '1675'
relation: later_version
status: public
scopus_import: 1
status: public
title: Proofs of Space
type: report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2276'
abstract:
- lang: eng
text: The problem of minimizing the Potts energy function frequently occurs in computer
vision applications. One way to tackle this NP-hard problem was proposed by Kovtun
[19, 20]. It identifies a part of an optimal solution by running k maxflow computations,
where k is the number of labels. The number of “labeled” pixels can be significant
in some applications, e.g. 50-93% in our tests for stereo. We show how to reduce
the runtime to O (log k) maxflow computations (or one parametric maxflow computation).
Furthermore, the output of our algorithm allows to speed-up the subsequent alpha
expansion for the unlabeled part, or can be used as it is for time-critical applications.
To derive our technique, we generalize the algorithm of Felzenszwalb et al. [7]
for Tree Metrics . We also show a connection to k-submodular functions from combinatorial
optimization, and discuss k-submodular relaxations for general energy functions.
arxiv: 1
author:
- first_name: Igor
full_name: Gridchyn, Igor
id: 4B60654C-F248-11E8-B48F-1D18A9856A87
last_name: Gridchyn
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Gridchyn I, Kolmogorov V. Potts model, parametric maxflow and k-submodular
functions. In: IEEE; 2013:2320-2327. doi:10.1109/ICCV.2013.288'
apa: 'Gridchyn, I., & Kolmogorov, V. (2013). Potts model, parametric maxflow
and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International
Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.288'
chicago: Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow
and k-Submodular Functions,” 2320–27. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.288.
ieee: 'I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular
functions,” presented at the ICCV: International Conference on Computer Vision,
Sydney, Australia, 2013, pp. 2320–2327.'
ista: 'Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular
functions. ICCV: International Conference on Computer Vision, 2320–2327.'
mla: Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow
and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288.
short: I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.
conference:
end_date: 2013-12-08
location: Sydney, Australia
name: 'ICCV: International Conference on Computer Vision'
start_date: 2013-12-01
date_created: 2018-12-11T11:56:43Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2021-01-12T06:56:28Z
day: '01'
department:
- _id: JoCs
- _id: VlKo
doi: 10.1109/ICCV.2013.288
external_id:
arxiv:
- '1310.1771'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1310.1771
month: '12'
oa: 1
oa_version: Preprint
page: 2320 - 2327
publication_status: published
publisher: IEEE
publist_id: '4668'
quality_controlled: '1'
status: public
title: Potts model, parametric maxflow and k-submodular functions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...