---
_id: '1832'
abstract:
- lang: eng
text: 'Linearizability of concurrent data structures is usually proved by monolithic
simulation arguments relying on the identification of the so-called linearization
points. Regrettably, such proofs, whether manual or automatic, are often complicated
and scale poorly to advanced non-blocking concurrency patterns, such as helping
and optimistic updates. In response, we propose a more modular way of checking
linearizability of concurrent queue algorithms that does not involve identifying
linearization points. We reduce the task of proving linearizability with respect
to the queue specification to establishing four basic properties, each of which
can be proved independently by simpler arguments. As a demonstration of our approach,
we verify the Herlihy and Wing queue, an algorithm that is challenging to verify
by a simulation proof. '
article_number: '20'
article_processing_charge: No
article_type: original
author:
- first_name: Soham
full_name: Chakraborty, Soham
last_name: Chakraborty
- 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: Ali
full_name: Sezgin, Ali
last_name: Sezgin
- first_name: Viktor
full_name: Vafeiadis, Viktor
last_name: Vafeiadis
citation:
ama: Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability
proofs. Logical Methods in Computer Science. 2015;11(1). doi:10.2168/LMCS-11(1:20)2015
apa: Chakraborty, S., Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2015).
Aspect-oriented linearizability proofs. Logical Methods in Computer Science.
International Federation of Computational Logic. https://doi.org/10.2168/LMCS-11(1:20)2015
chicago: Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis.
“Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science.
International Federation of Computational Logic, 2015. https://doi.org/10.2168/LMCS-11(1:20)2015.
ieee: S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented
linearizability proofs,” Logical Methods in Computer Science, vol. 11,
no. 1. International Federation of Computational Logic, 2015.
ista: Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented
linearizability proofs. Logical Methods in Computer Science. 11(1), 20.
mla: Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” Logical
Methods in Computer Science, vol. 11, no. 1, 20, International Federation
of Computational Logic, 2015, doi:10.2168/LMCS-11(1:20)2015.
short: S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods
in Computer Science 11 (2015).
corr_author: '1'
date_created: 2018-12-11T11:54:15Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2025-09-23T07:56:20Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.2168/LMCS-11(1:20)2015
ec_funded: 1
external_id:
isi:
- '000353193000019'
file:
- access_level: open_access
checksum: 7370e164d0a731f442424a92669efc34
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:27Z
date_updated: 2020-07-14T12:45:17Z
file_id: '4881'
file_name: IST-2015-390-v1+1_1502.07639.pdf
file_size: 380203
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '04'
oa: 1
oa_version: Published Version
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: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '5271'
pubrep_id: '390'
quality_controlled: '1'
related_material:
record:
- id: '2328'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Aspect-oriented linearizability proofs
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 11
year: '2015'
...
---
OA_type: closed access
_id: '18326'
abstract:
- lang: eng
text: Nonrigid shapes are ubiquitous in nature and are encountered at all levels
of life, from macro to nano. The need to model such shapes and understand their
behavior arises in many applications in imaging sciences, pattern recognition,
computer vision, and computer graphics. Of particular importance is understanding
which properties of the shape are attributed to deformations and which are invariant,
i.e., remain unchanged. This chapter presents an approach to nonrigid shapes from
the point of view of metric geometry. Modeling shapes as metric spaces, one can
pose the problem of shape similarity as the similarity of metric spaces and harness
tools from theoretical metric geometry for the computation of such a similarity.
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
citation:
ama: 'Bronstein AM, Bronstein MM. Manifold Intrinsic Similarity. In: Scherzer O,
ed. Handbook of Mathematical Methods in Imaging. 2nd ed. New York: Springer
Nature; 2015:1859-1908. doi:10.1007/978-1-4939-0790-8_57'
apa: 'Bronstein, A. M., & Bronstein, M. M. (2015). Manifold Intrinsic Similarity.
In O. Scherzer (Ed.), Handbook of Mathematical Methods in Imaging (2nd
ed., pp. 1859–1908). New York: Springer Nature. https://doi.org/10.1007/978-1-4939-0790-8_57'
chicago: 'Bronstein, Alex M., and Michael M. Bronstein. “Manifold Intrinsic Similarity.”
In Handbook of Mathematical Methods in Imaging, edited by Otmar Scherzer,
2nd ed., 1859–1908. New York: Springer Nature, 2015. https://doi.org/10.1007/978-1-4939-0790-8_57.'
ieee: 'A. M. Bronstein and M. M. Bronstein, “Manifold Intrinsic Similarity,” in
Handbook of Mathematical Methods in Imaging, 2nd ed., O. Scherzer, Ed.
New York: Springer Nature, 2015, pp. 1859–1908.'
ista: 'Bronstein AM, Bronstein MM. 2015.Manifold Intrinsic Similarity. In: Handbook
of Mathematical Methods in Imaging. , 1859–1908.'
mla: Bronstein, Alex M., and Michael M. Bronstein. “Manifold Intrinsic Similarity.”
Handbook of Mathematical Methods in Imaging, edited by Otmar Scherzer,
2nd ed., Springer Nature, 2015, pp. 1859–908, doi:10.1007/978-1-4939-0790-8_57.
short: A.M. Bronstein, M.M. Bronstein, in:, O. Scherzer (Ed.), Handbook of Mathematical
Methods in Imaging, 2nd ed., Springer Nature, New York, 2015, pp. 1859–1908.
date_created: 2024-10-15T11:20:53Z
date_published: 2015-05-30T00:00:00Z
date_updated: 2024-10-22T08:12:57Z
day: '30'
doi: 10.1007/978-1-4939-0790-8_57
edition: '2'
editor:
- first_name: Otmar
full_name: Scherzer, Otmar
last_name: Scherzer
extern: '1'
language:
- iso: eng
month: '05'
oa_version: None
page: 1859-1908
place: New York
publication: Handbook of Mathematical Methods in Imaging
publication_identifier:
eisbn:
- '9781493907908'
isbn:
- '9781493907892'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Manifold Intrinsic Similarity
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
OA_type: closed access
_id: '18327'
abstract:
- lang: eng
text: 'Source separation is a widely studied problem in signal processing. Despite
the permanent progress reported in the literature it is still considered a significant
challenge. This chapter first reviews the use of non-negative matrix factorization
(NMF) algorithms for solving source separation problems, and proposes a new way
for the supervised training in NMF. Matrix factorization methods have received
a lot of attention in recent year in the audio processing community, producing
particularly good results in source separation. Traditionally, NMF algorithms
consist of two separate stages: a training stage, in which a generative model
is learned; and a testing stage in which the pre-learned model is used in a high
level task such as enhancement, separation, or classification. As an alternative,
we propose a task-supervised NMF method for the adaptation of the basis spectra
learned in the first stage to enhance the performance on the specific task used
in the second stage. We cast this problem as a bilevel optimization program efficiently
solved via stochastic gradient descent. The proposed approach is general enough
to handle sparsity priors of the activations, and allow non-Euclidean data terms
such as β-divergences. The framework is evaluated on speech enhancement.'
alternative_title:
- Applied and Numerical Harmonic Analysis
article_processing_charge: No
author:
- first_name: Pablo
full_name: Sprechmann, Pablo
last_name: Sprechmann
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Guillermo
full_name: Sapiro, Guillermo
last_name: Sapiro
citation:
ama: 'Sprechmann P, Bronstein AM, Sapiro G. Supervised non-negative matrix factorization
for audio source separation. In: Excursions in Harmonic Analysis, Volumne 4.
1st ed. Cham: Springer Nature; 2015:407-420. doi:10.1007/978-3-319-20188-7_16'
apa: 'Sprechmann, P., Bronstein, A. M., & Sapiro, G. (2015). Supervised non-negative
matrix factorization for audio source separation. In Excursions in Harmonic
Analysis, Volumne 4 (1st ed., pp. 407–420). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-20188-7_16'
chicago: 'Sprechmann, Pablo, Alex M. Bronstein, and Guillermo Sapiro. “Supervised
Non-Negative Matrix Factorization for Audio Source Separation.” In Excursions
in Harmonic Analysis, Volumne 4, 1st ed., 407–20. Cham: Springer Nature, 2015.
https://doi.org/10.1007/978-3-319-20188-7_16.'
ieee: 'P. Sprechmann, A. M. Bronstein, and G. Sapiro, “Supervised non-negative matrix
factorization for audio source separation,” in Excursions in Harmonic Analysis,
Volumne 4, 1st ed., Cham: Springer Nature, 2015, pp. 407–420.'
ista: 'Sprechmann P, Bronstein AM, Sapiro G. 2015.Supervised non-negative matrix
factorization for audio source separation. In: Excursions in Harmonic Analysis,
Volumne 4. Applied and Numerical Harmonic Analysis, , 407–420.'
mla: Sprechmann, Pablo, et al. “Supervised Non-Negative Matrix Factorization for
Audio Source Separation.” Excursions in Harmonic Analysis, Volumne 4, 1st
ed., Springer Nature, 2015, pp. 407–20, doi:10.1007/978-3-319-20188-7_16.
short: P. Sprechmann, A.M. Bronstein, G. Sapiro, in:, Excursions in Harmonic Analysis,
Volumne 4, 1st ed., Springer Nature, Cham, 2015, pp. 407–420.
date_created: 2024-10-15T11:20:53Z
date_published: 2015-10-30T00:00:00Z
date_updated: 2024-10-22T08:09:36Z
day: '30'
doi: 10.1007/978-3-319-20188-7_16
edition: '1'
extern: '1'
language:
- iso: eng
month: '10'
oa_version: None
page: 407-420
place: Cham
publication: Excursions in Harmonic Analysis, Volumne 4
publication_identifier:
eisbn:
- '9783319201887'
eissn:
- 2296-5017
isbn:
- '9783319201870'
issn:
- 2296-5009
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Supervised non-negative matrix factorization for audio source separation
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1834'
abstract:
- lang: eng
text: Huge body of evidences demonstrated that volatile anesthetics affect the hippocampal
neurogenesis and neurocognitive functions, and most of them showed impairment
at anesthetic dose. Here, we investigated the effect of low dose (1.8%) sevoflurane
on hippocampal neurogenesis and dentate gyrus-dependent learning. Neonatal rats
at postnatal day 4 to 6 (P4-6) were treated with 1.8% sevoflurane for 6 hours.
Neurogenesis was quantified by bromodeoxyuridine labeling and electrophysiology
recording. Four and seven weeks after treatment, the Morris water maze and contextual-fear
discrimination learning tests were performed to determine the influence on spatial
learning and pattern separation. A 6-hour treatment with 1.8% sevoflurane promoted
hippocampal neurogenesis and increased the survival of newborn cells and the proportion
of immature granular cells in the dentate gyrus of neonatal rats. Sevoflurane-treated
rats performed better during the training days of the Morris water maze test and
in contextual-fear discrimination learning test. These results suggest that a
subanesthetic dose of sevoflurane promotes hippocampal neurogenesis in neonatal
rats and facilitates their performance in dentate gyrus-dependent learning tasks.
article_processing_charge: No
article_type: original
author:
- first_name: Chong
full_name: Chen, Chong
id: 3DFD581A-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Chao
full_name: Wang, Chao
last_name: Wang
- first_name: Xuan
full_name: Zhao, Xuan
last_name: Zhao
- first_name: Tao
full_name: Zhou, Tao
last_name: Zhou
- first_name: Dao
full_name: Xu, Dao
last_name: Xu
- first_name: Zhi
full_name: Wang, Zhi
last_name: Wang
- first_name: Ying
full_name: Wang, Ying
last_name: Wang
citation:
ama: Chen C, Wang C, Zhao X, et al. Low-dose sevoflurane promoteshippocampal neurogenesis
and facilitates the development of dentate gyrus-dependent learning in neonatal
rats. ASN Neuro. 2015;7(2). doi:10.1177/1759091415575845
apa: Chen, C., Wang, C., Zhao, X., Zhou, T., Xu, D., Wang, Z., & Wang, Y. (2015).
Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development
of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. SAGE Publications.
https://doi.org/10.1177/1759091415575845
chicago: Chen, Chong, Chao Wang, Xuan Zhao, Tao Zhou, Dao Xu, Zhi Wang, and Ying
Wang. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the
Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” ASN Neuro.
SAGE Publications, 2015. https://doi.org/10.1177/1759091415575845.
ieee: C. Chen et al., “Low-dose sevoflurane promoteshippocampal neurogenesis
and facilitates the development of dentate gyrus-dependent learning in neonatal
rats,” ASN Neuro, vol. 7, no. 2. SAGE Publications, 2015.
ista: Chen C, Wang C, Zhao X, Zhou T, Xu D, Wang Z, Wang Y. 2015. Low-dose sevoflurane
promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent
learning in neonatal rats. ASN Neuro. 7(2).
mla: Chen, Chong, et al. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis
and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal
Rats.” ASN Neuro, vol. 7, no. 2, SAGE Publications, 2015, doi:10.1177/1759091415575845.
short: C. Chen, C. Wang, X. Zhao, T. Zhou, D. Xu, Z. Wang, Y. Wang, ASN Neuro 7
(2015).
date_created: 2018-12-11T11:54:16Z
date_published: 2015-04-13T00:00:00Z
date_updated: 2025-09-23T09:31:50Z
day: '13'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1177/1759091415575845
external_id:
isi:
- '000353223200002'
file:
- access_level: open_access
checksum: 53e16bd3fc2ae2c0d7de9164626c37aa
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:08Z
date_updated: 2020-07-14T12:45:18Z
file_id: '5057'
file_name: IST-2016-456-v1+1_ASN_Neuro-2015-Chen-.pdf
file_size: 1146814
relation: main_file
file_date_updated: 2020-07-14T12:45:18Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '04'
oa: 1
oa_version: Published Version
publication: ASN Neuro
publication_status: published
publisher: SAGE Publications
publist_id: '5269'
pubrep_id: '456'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development
of dentate gyrus-dependent learning in neonatal rats
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 7
year: '2015'
...
---
_id: '1835'
abstract:
- lang: eng
text: The behaviour of gene regulatory networks (GRNs) is typically analysed using
simulation-based statistical testing-like methods. In this paper, we demonstrate
that we can replace this approach by a formal verification-like method that gives
higher assurance and scalability. We focus on Wagner’s weighted GRN model with
varying weights, which is used in evolutionary biology. In the model, weight parameters
represent the gene interaction strength that may change due to genetic mutations.
For a property of interest, we synthesise the constraints over the parameter space
that represent the set of GRNs satisfying the property. We experimentally show
that our parameter synthesis procedure computes the mutational robustness of GRNs
–an important problem of interest in evolutionary biology– more efficiently than
the classical simulation method. We specify the property in linear temporal logics.
We employ symbolic bounded model checking and SMT solving to compute the space
of GRNs that satisfy the property, which amounts to synthesizing a set of linear
constraints on the weights.
acknowledgement: "SNSF Early Postdoc.Mobility Fellowship, the grant number P2EZP2
148797.\r\n"
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- 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: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking
gene regulatory networks. 2015;9035:469-483. doi:10.1007/978-3-662-46681-0_47
apa: 'Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &
Petrov, T. (2015). Model checking gene regulatory networks. Presented at the TACAS:
Tools and Algorithms for the Construction and Analysis of Systems, London, United
Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_47'
chicago: Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago
Paixao, and Tatjana Petrov. “Model Checking Gene Regulatory Networks.” Lecture
Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_47.
ieee: M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov,
“Model checking gene regulatory networks,” vol. 9035. Springer, pp. 469–483, 2015.
ista: Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2015. Model
checking gene regulatory networks. 9035, 469–483.
mla: Giacobbe, Mirco, et al. Model Checking Gene Regulatory Networks. Vol.
9035, Springer, 2015, pp. 469–83, doi:10.1007/978-3-662-46681-0_47.
short: M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, 9035
(2015) 469–483.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:16Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2025-07-10T11:50:42Z
day: '01'
department:
- _id: ToHe
- _id: CaGu
- _id: NiBa
doi: 10.1007/978-3-662-46681-0_47
ec_funded: 1
external_id:
arxiv:
- '1410.7704'
intvolume: ' 9035'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1410.7704
month: '04'
oa: 1
oa_version: Preprint
page: 469 - 483
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5267'
quality_controlled: '1'
related_material:
record:
- id: '1351'
relation: later_version
status: public
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: Model checking gene regulatory networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9035
year: '2015'
...
---
_id: '1836'
abstract:
- lang: eng
text: In the standard framework for worst-case execution time (WCET) analysis of
programs, the main data structure is a single instance of integer linear programming
(ILP) that represents the whole program. The instance of this NP-hard problem
must be solved to find an estimate forWCET, and it must be refined if the estimate
is not tight.We propose a new framework for WCET analysis, based on abstract segment
trees (ASTs) as the main data structure. The ASTs have two advantages. First,
they allow computing WCET by solving a number of independent small ILP instances.
Second, ASTs store more expressive constraints, thus enabling a more efficient
and precise refinement procedure. In order to realize our framework algorithmically,
we develop an algorithm for WCET estimation on ASTs, and we develop an interpolation-based
counterexample-guided refinement scheme for ASTs. Furthermore, we extend our framework
to obtain parametric estimates of WCET. We experimentally evaluate our approach
on a set of examples from WCET benchmark suites and linear-algebra packages. We
show that our analysis, with comparable effort, provides WCET estimates that in
many cases significantly improve those computed by existing tools.
alternative_title:
- LNCS
article_processing_charge: No
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: Laura
full_name: Kovács, Laura
last_name: Kovács
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Jakob
full_name: Zwirchmayr, Jakob
last_name: Zwirchmayr
citation:
ama: Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. Segment abstraction
for worst-case execution time analysis. 2015;9032:105-131. doi:10.1007/978-3-662-46669-8_5
apa: 'Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., & Zwirchmayr,
J. (2015). Segment abstraction for worst-case execution time analysis. Presented
at the ESOP: European Symposium on Programming, London, United Kingdom: Springer.
https://doi.org/10.1007/978-3-662-46669-8_5'
chicago: Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and
Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.”
Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46669-8_5.
ieee: P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr,
“Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer,
pp. 105–131, 2015.
ista: Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. 2015. Segment
abstraction for worst-case execution time analysis. 9032, 105–131.
mla: Cerny, Pavol, et al. Segment Abstraction for Worst-Case Execution Time Analysis.
Vol. 9032, Springer, 2015, pp. 105–31, doi:10.1007/978-3-662-46669-8_5.
short: P. Cerny, T.A. Henzinger, L. Kovács, A. Radhakrishna, J. Zwirchmayr, 9032
(2015) 105–131.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'ESOP: European Symposium on Programming'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:16Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2025-09-23T10:42:04Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-662-46669-8_5
ec_funded: 1
external_id:
isi:
- '000361751400005'
intvolume: ' 9032'
isi: 1
language:
- iso: eng
month: '04'
oa_version: None
page: 105 - 131
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _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: '5266'
quality_controlled: '1'
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: Segment abstraction for worst-case execution time analysis
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9032
year: '2015'
...
---
DOAJ_listed: '1'
_id: '18365'
abstract:
- lang: eng
text: Yeast cells with DNA damage avoid respiration, presumably because products
of oxidative metabolism can be harmful to DNA. We show that DNA damage inhibits
the activity of the Snf1 (AMP-activated) protein kinase (AMPK), which activates
expression of genes required for respiration. Glucose and DNA damage upregulate
SUMOylation of Snf1, catalyzed by the SUMO E3 ligase Mms21, which inhibits SNF1
activity. The DNA damage checkpoint kinases Mec1/ATR and Tel1/ATM, as well as
the nutrient-sensing protein kinase A (PKA), regulate Mms21 activity toward Snf1.
Mec1 and Tel1 are required for two SNF1-regulated processes—glucose sensing and
ADH2 gene expression—even without exogenous genotoxic stress. Our results imply
that inhibition of Snf1 by SUMOylation is a mechanism by which cells lower their
respiration in response to DNA damage. This raises the possibility that activation
of DNA damage checkpoint mechanisms could contribute to aerobic fermentation (Warburg
effect), a hallmark of cancer cells.
article_processing_charge: No
author:
- first_name: Kobi J.
full_name: Simpson-Lavy, Kobi J.
last_name: Simpson-Lavy
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Martin
full_name: Kupiec, Martin
last_name: Kupiec
- first_name: Mark
full_name: Johnston, Mark
last_name: Johnston
citation:
ama: Simpson-Lavy KJ, Bronstein AM, Kupiec M, Johnston M. Cross-talk between carbon
cetabolism and the DNA camage response in S. cerevisiae. Cell Reports.
2015;12(11):1865-1875. doi:10.1016/j.celrep.2015.08.025
apa: Simpson-Lavy, K. J., Bronstein, A. M., Kupiec, M., & Johnston, M. (2015).
Cross-talk between carbon cetabolism and the DNA camage response in S. cerevisiae.
Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2015.08.025
chicago: Simpson-Lavy, Kobi J., Alex M. Bronstein, Martin Kupiec, and Mark Johnston.
“Cross-Talk between Carbon Cetabolism and the DNA Camage Response in S. Cerevisiae.”
Cell Reports. Elsevier, 2015. https://doi.org/10.1016/j.celrep.2015.08.025.
ieee: K. J. Simpson-Lavy, A. M. Bronstein, M. Kupiec, and M. Johnston, “Cross-talk
between carbon cetabolism and the DNA camage response in S. cerevisiae,” Cell
Reports, vol. 12, no. 11. Elsevier, pp. 1865–1875, 2015.
ista: Simpson-Lavy KJ, Bronstein AM, Kupiec M, Johnston M. 2015. Cross-talk between
carbon cetabolism and the DNA camage response in S. cerevisiae. Cell Reports.
12(11), 1865–1875.
mla: Simpson-Lavy, Kobi J., et al. “Cross-Talk between Carbon Cetabolism and the
DNA Camage Response in S. Cerevisiae.” Cell Reports, vol. 12, no. 11, Elsevier,
2015, pp. 1865–75, doi:10.1016/j.celrep.2015.08.025.
short: K.J. Simpson-Lavy, A.M. Bronstein, M. Kupiec, M. Johnston, Cell Reports 12
(2015) 1865–1875.
date_created: 2024-10-15T11:20:54Z
date_published: 2015-09-22T00:00:00Z
date_updated: 2024-12-18T12:23:56Z
day: '22'
doi: 10.1016/j.celrep.2015.08.025
extern: '1'
intvolume: ' 12'
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.celrep.2015.08.025
month: '09'
oa: 1
oa_version: Published Version
page: 1865-1875
publication: Cell Reports
publication_identifier:
issn:
- 2211-1247
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cross-talk between carbon cetabolism and the DNA camage response in S. cerevisiae
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2015'
...
---
_id: '1837'
abstract:
- lang: eng
text: 'Transition to turbulence in straight pipes occurs in spite of the linear
stability of the laminar Hagen-Poiseuille flow if both the amplitude of flow perturbations
and the Reynolds number Re exceed a minimum threshold (subcritical transition).
As the pipe curvature increases, centrifugal effects become important, modifying
the basic flow as well as the most unstable linear modes. If the curvature (tube-to-coiling
diameter d/D) is sufficiently large, a Hopf bifurcation (supercritical instability)
is encountered before turbulence can be excited (subcritical instability). We
trace the instability thresholds in the Re - d/D parameter space in the range
0.01 ≤ d/D\ ≤ 0.1 by means of laser-Doppler velocimetry and determine the point
where the subcritical and supercritical instabilities meet. Two different experimental
set-ups are used: a closed system where the pipe forms an axisymmetric torus and
an open system employing a helical pipe. Implications for the measurement of friction
factors in curved pipes are discussed.'
article_number: R3
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: P
full_name: Braunshier, P
last_name: Braunshier
- first_name: M
full_name: Schwegel, M
last_name: Schwegel
- first_name: Hendrik
full_name: Kuhlmann, Hendrik
last_name: Kuhlmann
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. Subcritical versus supercritical
transition to turbulence in curved pipes. Journal of Fluid Mechanics. 2015;770(5).
doi:10.1017/jfm.2015.184
apa: Kühnen, J., Braunshier, P., Schwegel, M., Kuhlmann, H., & Hof, B. (2015).
Subcritical versus supercritical transition to turbulence in curved pipes. Journal
of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2015.184
chicago: Kühnen, Jakob, P Braunshier, M Schwegel, Hendrik Kuhlmann, and Björn Hof.
“Subcritical versus Supercritical Transition to Turbulence in Curved Pipes.” Journal
of Fluid Mechanics. Cambridge University Press, 2015. https://doi.org/10.1017/jfm.2015.184.
ieee: J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, and B. Hof, “Subcritical
versus supercritical transition to turbulence in curved pipes,” Journal of
Fluid Mechanics, vol. 770, no. 5. Cambridge University Press, 2015.
ista: Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. 2015. Subcritical versus
supercritical transition to turbulence in curved pipes. Journal of Fluid Mechanics.
770(5), R3.
mla: Kühnen, Jakob, et al. “Subcritical versus Supercritical Transition to Turbulence
in Curved Pipes.” Journal of Fluid Mechanics, vol. 770, no. 5, R3, Cambridge
University Press, 2015, doi:10.1017/jfm.2015.184.
short: J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, B. Hof, Journal of Fluid
Mechanics 770 (2015).
corr_author: '1'
date_created: 2018-12-11T11:54:17Z
date_published: 2015-04-08T00:00:00Z
date_updated: 2025-09-23T10:50:18Z
day: '08'
department:
- _id: BjHo
doi: 10.1017/jfm.2015.184
ec_funded: 1
external_id:
arxiv:
- '1508.06559'
isi:
- '000354190500003'
intvolume: ' 770'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.06559
month: '04'
oa: 1
oa_version: Preprint
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Journal of Fluid Mechanics
publication_status: published
publisher: Cambridge University Press
publist_id: '5265'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Subcritical versus supercritical transition to turbulence in curved pipes
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 770
year: '2015'
...
---
_id: '18371'
abstract:
- lang: eng
text: We consider the problem of exact and inexact matching of weighted undirected
graphs, in which a bijective correspondence is sought to minimize a quadratic
weight disagreement. This computationally challenging problem is often relaxed
as a convex quadratic program, in which the space of permutations is replaced
by the space of doubly stochastic matrices. However, the applicability of such
a relaxation is poorly understood. We define a broad class of friendly graphs
characterized by an easily verifiable spectral property. We prove that for friendly
graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify
its inexistence. This result is further extended to approximately isomorphic graphs,
for which we develop an explicit bound on the amount of weight disagreement under
which the relaxation is guaranteed to find the globally optimal approximate isomorphism.
We also show that in many cases, the graph matching problem can be further harmlessly
relaxed to a convex quadratic program with only n separable linear equality constraints,
which is substantially more efficient than the standard relaxation involving 2n
equality and n2 inequality constraints. Finally, we show that our results are
still valid for unfriendly graphs if additional information in the form of seeds
or attributes is allowed, with the latter satisfying an easy to verify spectral
characteristic.
article_processing_charge: No
article_type: original
author:
- first_name: Yonathan
full_name: Aflalo, Yonathan
last_name: Aflalo
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: Aflalo Y, Bronstein AM, Kimmel R. On convex relaxation of graph isomorphism.
Proceedings of the National Academy of Sciences. 2015;112(10):2942-2947.
doi:10.1073/pnas.1401651112
apa: Aflalo, Y., Bronstein, A. M., & Kimmel, R. (2015). On convex relaxation
of graph isomorphism. Proceedings of the National Academy of Sciences.
National Academy of Sciences. https://doi.org/10.1073/pnas.1401651112
chicago: Aflalo, Yonathan, Alex M. Bronstein, and Ron Kimmel. “On Convex Relaxation
of Graph Isomorphism.” Proceedings of the National Academy of Sciences.
National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1401651112.
ieee: Y. Aflalo, A. M. Bronstein, and R. Kimmel, “On convex relaxation of graph
isomorphism,” Proceedings of the National Academy of Sciences, vol. 112,
no. 10. National Academy of Sciences, pp. 2942–2947, 2015.
ista: Aflalo Y, Bronstein AM, Kimmel R. 2015. On convex relaxation of graph isomorphism.
Proceedings of the National Academy of Sciences. 112(10), 2942–2947.
mla: Aflalo, Yonathan, et al. “On Convex Relaxation of Graph Isomorphism.” Proceedings
of the National Academy of Sciences, vol. 112, no. 10, National Academy of
Sciences, 2015, pp. 2942–47, doi:10.1073/pnas.1401651112.
short: Y. Aflalo, A.M. Bronstein, R. Kimmel, Proceedings of the National Academy
of Sciences 112 (2015) 2942–2947.
date_created: 2024-10-15T11:20:54Z
date_published: 2015-03-10T00:00:00Z
date_updated: 2024-11-12T08:54:37Z
day: '10'
doi: 10.1073/pnas.1401651112
extern: '1'
external_id:
pmid:
- '25713342'
intvolume: ' 112'
issue: '10'
language:
- iso: eng
month: '03'
oa_version: None
page: 2942-2947
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: On convex relaxation of graph isomorphism
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2015'
...
---
_id: '1838'
abstract:
- lang: eng
text: Synthesis of program parts is particularly useful for concurrent systems.
However, most approaches do not support common design tasks, like modifying a
single process without having to re-synthesize or verify the whole system. Assume-guarantee
synthesis (AGS) provides robustness against modifications of system parts, but
thus far has been limited to the perfect information setting. This means that
local variables cannot be hidden from other processes, which renders synthesis
results cumbersome or even impossible to realize.We resolve this shortcoming by
defining AGS under partial information. We analyze the complexity and decidability
in different settings, showing that the problem has a high worstcase complexity
and is undecidable in many interesting cases. Based on these observations, we
present a pragmatic algorithm based on bounded synthesis, and demonstrate its
practical applicability on several examples.
acknowledgement: 'This work was supported by the Austrian Science Fund (FWF) through
the research network RiSE (S11406-N23, S11407-N23) and grant nr. P23499-N23, by
the European Commission through an ERC Start grant (279307: Graph Games) and project
STANCE (317753), as well as by the German Research Foundation (DFG) through SFB/TR
14 AVACS and project ASDPS(JA 2357/2-1).'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Swen
full_name: Jacobs, Swen
last_name: Jacobs
- first_name: Robert
full_name: Könighofer, Robert
last_name: Könighofer
citation:
ama: 'Bloem R, Chatterjee K, Jacobs S, Könighofer R. Assume-guarantee synthesis
for concurrent reactive programs with partial information. In: Vol 9035. Springer;
2015:517-532. doi:10.1007/978-3-662-46681-0_50'
apa: 'Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee
synthesis for concurrent reactive programs with partial information (Vol. 9035,
pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_50'
chicago: Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer.
“Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,”
9035:517–32. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_50.
ieee: 'R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee
synthesis for concurrent reactive programs with partial information,” presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
London, United Kingdom, 2015, vol. 9035, pp. 517–532.'
ista: 'Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis
for concurrent reactive programs with partial information. TACAS: Tools and Algorithms
for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532.'
mla: Bloem, Roderick, et al. Assume-Guarantee Synthesis for Concurrent Reactive
Programs with Partial Information. Vol. 9035, Springer, 2015, pp. 517–32,
doi:10.1007/978-3-662-46681-0_50.
short: R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp.
517–532.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:17Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2025-06-11T07:09:03Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-46681-0_50
ec_funded: 1
external_id:
arxiv:
- '1411.4604'
intvolume: ' 9035'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1411.4604
month: '01'
oa: 1
oa_version: Preprint
page: 517 - 532
project:
- _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: 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: '5264'
scopus_import: '1'
status: public
title: Assume-guarantee synthesis for concurrent reactive programs with partial information
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9035
year: '2015'
...
---
_id: '18380'
abstract:
- lang: eng
text: This work presents a novel approach for detecting inliers in a given set of
correspondences (matches). It does so without explicitly identifying any consensus
set, based on a method for inlier rate estimation (IRE). Given such an estimator
for the inlier rate, we also present an algorithm that detects a globally optimal
transformation. We provide a theoretical analysis of the IRE method using a stochastic
generative model on the continuous spaces of matches and transformations. This
model allows rigorous investigation of the limits of our IRE method for the case
of 2D-translation, further giving bounds and insights for the more general case.
Our theoretical analysis is validated empirically and is shown to hold in practice
for the more general case of 2D-affinities. In addition, we show that the combined
framework works on challenging cases of 2D-homography estimation, with very few
and possibly noisy inliers, where RANSAC generally fails.
article_number: '7299161'
article_processing_charge: No
author:
- first_name: Roee
full_name: Litman, Roee
last_name: Litman
- first_name: Simon
full_name: Korman, Simon
last_name: Korman
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Shai
full_name: Avidan, Shai
last_name: Avidan
citation:
ama: 'Litman R, Korman S, Bronstein AM, Avidan S. Inverting RANSAC: Global model
detection via inlier rate estimation. In: 2015 IEEE Conference on Computer
Vision and Pattern Recognition (CVPR). IEEE; 2015. doi:10.1109/cvpr.2015.7299161'
apa: 'Litman, R., Korman, S., Bronstein, A. M., & Avidan, S. (2015). Inverting
RANSAC: Global model detection via inlier rate estimation. In 2015 IEEE Conference
on Computer Vision and Pattern Recognition (CVPR). Boston, MA, United States:
IEEE. https://doi.org/10.1109/cvpr.2015.7299161'
chicago: 'Litman, Roee, Simon Korman, Alex M. Bronstein, and Shai Avidan. “Inverting
RANSAC: Global Model Detection via Inlier Rate Estimation.” In 2015 IEEE Conference
on Computer Vision and Pattern Recognition (CVPR). IEEE, 2015. https://doi.org/10.1109/cvpr.2015.7299161.'
ieee: 'R. Litman, S. Korman, A. M. Bronstein, and S. Avidan, “Inverting RANSAC:
Global model detection via inlier rate estimation,” in 2015 IEEE Conference
on Computer Vision and Pattern Recognition (CVPR), Boston, MA, United States,
2015.'
ista: 'Litman R, Korman S, Bronstein AM, Avidan S. 2015. Inverting RANSAC: Global
model detection via inlier rate estimation. 2015 IEEE Conference on Computer Vision
and Pattern Recognition (CVPR). IEEE Conference on Computer Vision and Pattern
Recognition, 7299161.'
mla: 'Litman, Roee, et al. “Inverting RANSAC: Global Model Detection via Inlier
Rate Estimation.” 2015 IEEE Conference on Computer Vision and Pattern Recognition
(CVPR), 7299161, IEEE, 2015, doi:10.1109/cvpr.2015.7299161.'
short: R. Litman, S. Korman, A.M. Bronstein, S. Avidan, in:, 2015 IEEE Conference
on Computer Vision and Pattern Recognition (CVPR), IEEE, 2015.
conference:
end_date: 2015-06-12
location: Boston, MA, United States
name: IEEE Conference on Computer Vision and Pattern Recognition
start_date: 2015-06-07
date_created: 2024-10-15T11:20:54Z
date_published: 2015-10-15T00:00:00Z
date_updated: 2024-12-04T14:06:06Z
day: '15'
doi: 10.1109/cvpr.2015.7299161
extern: '1'
language:
- iso: eng
month: '10'
oa_version: None
publication: 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
publication_identifier:
eissn:
- 1063-6919
isbn:
- '9781467369640'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Inverting RANSAC: Global model detection via inlier rate estimation'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '18387'
abstract:
- lang: eng
text: Sparse models in dictionary learning have been successfully applied in a wide
variety of machine learning and computer vision problems, and have also recently
been of increasing research interest. Another interesting related problem based
on a linear equality constraint, namely the sparse null space problem (SNS), first
appeared in 1986, and has since inspired results on sparse basis pursuit. In this
paper, we investigate the relation between the SNS problem and the analysis dictionary
learning problem, and show that the SNS problem plays a central role, and may
be utilized to solve dictionary learning problems. Moreover, we propose an efficient
algorithm of sparse null space basis pursuit, and extend it to a solution of analysis
dictionary learning. Experimental results on numerical synthetic data and real-world
data are further presented to validate the performance of our method.
article_number: '7178678'
article_processing_charge: No
author:
- first_name: Xiao
full_name: Bian, Xiao
last_name: Bian
- first_name: Hamid
full_name: Krim, Hamid
last_name: Krim
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Liyi
full_name: Dai, Liyi
last_name: Dai
citation:
ama: 'Bian X, Krim H, Bronstein AM, Dai L. Sparse null space basis pursuit and analysis
dictionary learning for high-dimensional data analysis. In: 2015 IEEE International
Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE; 2015.
doi:10.1109/icassp.2015.7178678'
apa: 'Bian, X., Krim, H., Bronstein, A. M., & Dai, L. (2015). Sparse null space
basis pursuit and analysis dictionary learning for high-dimensional data analysis.
In 2015 IEEE International Conference on Acoustics, Speech and Signal Processing
(ICASSP). South Brisbane, QLD, Australia: IEEE. https://doi.org/10.1109/icassp.2015.7178678'
chicago: Bian, Xiao, Hamid Krim, Alex M. Bronstein, and Liyi Dai. “Sparse Null Space
Basis Pursuit and Analysis Dictionary Learning for High-Dimensional Data Analysis.”
In 2015 IEEE International Conference on Acoustics, Speech and Signal Processing
(ICASSP). IEEE, 2015. https://doi.org/10.1109/icassp.2015.7178678.
ieee: X. Bian, H. Krim, A. M. Bronstein, and L. Dai, “Sparse null space basis pursuit
and analysis dictionary learning for high-dimensional data analysis,” in 2015
IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP),
South Brisbane, QLD, Australia, 2015.
ista: Bian X, Krim H, Bronstein AM, Dai L. 2015. Sparse null space basis pursuit
and analysis dictionary learning for high-dimensional data analysis. 2015 IEEE
International Conference on Acoustics, Speech and Signal Processing (ICASSP).
40th IEEE International Conference on Acoustics, Speech, and Signal Processing,
7178678.
mla: Bian, Xiao, et al. “Sparse Null Space Basis Pursuit and Analysis Dictionary
Learning for High-Dimensional Data Analysis.” 2015 IEEE International Conference
on Acoustics, Speech and Signal Processing (ICASSP), 7178678, IEEE, 2015,
doi:10.1109/icassp.2015.7178678.
short: X. Bian, H. Krim, A.M. Bronstein, L. Dai, in:, 2015 IEEE International Conference
on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2015.
conference:
end_date: 2015-04-24
location: South Brisbane, QLD, Australia
name: 40th IEEE International Conference on Acoustics, Speech, and Signal Processing
start_date: 2015-04-19
date_created: 2024-10-15T11:20:54Z
date_published: 2015-08-06T00:00:00Z
date_updated: 2024-12-04T14:01:05Z
day: '06'
doi: 10.1109/icassp.2015.7178678
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
publication: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing
(ICASSP)
publication_identifier:
eisbn:
- '9781467369978'
eissn:
- 2379-190X
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sparse null space basis pursuit and analysis dictionary learning for high-dimensional
data analysis
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1839'
abstract:
- lang: eng
text: We present MultiGain, a tool to synthesize strategies for Markov decision
processes (MDPs) with multiple mean-payoff objectives. Our models are described
in PRISM, and our tool uses the existing interface and simulator of PRISM. Our
tool extends PRISM by adding novel algorithms for multiple mean-payoff objectives,
and also provides features such as (i) generating strategies and exploring them
for simulation, and checking them with respect to other properties; and (ii) generating
an approximate Pareto curve for two mean-payoff objectives. In addition, we present
a new practical algorithm for the analysis of MDPs with multiple mean-payoff objectives
under memoryless strategies.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- 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: Antonín
full_name: Kučera, Antonín
last_name: Kučera
citation:
ama: 'Brázdil T, Chatterjee K, Forejt V, Kučera A. Multigain: A controller synthesis
tool for MDPs with multiple mean-payoff objectives. 2015;9035:181-187. doi:10.1007/978-3-662-46681-0_12'
apa: 'Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2015). Multigain:
A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_12'
chicago: 'Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera.
“Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.”
Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_12.'
ieee: 'T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller
synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer,
pp. 181–187, 2015.'
ista: 'Brázdil T, Chatterjee K, Forejt V, Kučera A. 2015. Multigain: A controller
synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.'
mla: 'Brázdil, Tomáš, et al. Multigain: A Controller Synthesis Tool for MDPs
with Multiple Mean-Payoff Objectives. Vol. 9035, Springer, 2015, pp. 181–87,
doi:10.1007/978-3-662-46681-0_12.'
short: T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:18Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2025-06-11T07:09:21Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-46681-0_12
ec_funded: 1
external_id:
arxiv:
- '1501.03093'
intvolume: ' 9035'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1501.03093
month: '01'
oa: 1
oa_version: Preprint
page: 181 - 187
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _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: '5263'
quality_controlled: '1'
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: 'Multigain: A controller synthesis tool for MDPs with multiple mean-payoff
objectives'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9035
year: '2015'
...
---
_id: '1840'
abstract:
- lang: eng
text: In this paper, we present a method for reducing a regular, discrete-time Markov
chain (DTMC) to another DTMC with a given, typically much smaller number of states.
The cost of reduction is defined as the Kullback-Leibler divergence rate between
a projection of the original process through a partition function and a DTMC on
the correspondingly partitioned state space. Finding the reduced model with minimal
cost is computationally expensive, as it requires an exhaustive search among all
state space partitions, and an exact evaluation of the reduction cost for each
candidate partition. Our approach deals with the latter problem by minimizing
an upper bound on the reduction cost instead of minimizing the exact cost. The
proposed upper bound is easy to compute and it is tight if the original chain
is lumpable with respect to the partition. Then, we express the problem in the
form of information bottleneck optimization, and propose using the agglomerative
information bottleneck algorithm for searching a suboptimal partition greedily,
rather than exhaustively. The theory is illustrated with examples and one application
scenario in the context of modeling bio-molecular interactions.
acknowledgement: "This work was supported by the Austrian Research Association under
Project 06/12684, by the Swiss National Science Foundation (SNSF) under Grant PP00P2
128503/1, by the SystemsX.ch (the Swiss Inititative for Systems Biology), and by
a SNSF Early Postdoc.Mobility Fellowship grant P2EZP2_148797.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Bernhard
full_name: Geiger, Bernhard
last_name: Geiger
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
- first_name: Gernot
full_name: Kubin, Gernot
last_name: Kubin
- first_name: Heinz
full_name: Koeppl, Heinz
last_name: Koeppl
citation:
ama: Geiger B, Petrov T, Kubin G, Koeppl H. Optimal Kullback-Leibler aggregation
via information bottleneck. IEEE Transactions on Automatic Control. 2015;60(4):1010-1022.
doi:10.1109/TAC.2014.2364971
apa: Geiger, B., Petrov, T., Kubin, G., & Koeppl, H. (2015). Optimal Kullback-Leibler
aggregation via information bottleneck. IEEE Transactions on Automatic Control.
IEEE. https://doi.org/10.1109/TAC.2014.2364971
chicago: Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal
Kullback-Leibler Aggregation via Information Bottleneck.” IEEE Transactions
on Automatic Control. IEEE, 2015. https://doi.org/10.1109/TAC.2014.2364971.
ieee: B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation
via information bottleneck,” IEEE Transactions on Automatic Control, vol.
60, no. 4. IEEE, pp. 1010–1022, 2015.
ista: Geiger B, Petrov T, Kubin G, Koeppl H. 2015. Optimal Kullback-Leibler aggregation
via information bottleneck. IEEE Transactions on Automatic Control. 60(4), 1010–1022.
mla: Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information
Bottleneck.” IEEE Transactions on Automatic Control, vol. 60, no. 4, IEEE,
2015, pp. 1010–22, doi:10.1109/TAC.2014.2364971.
short: B. Geiger, T. Petrov, G. Kubin, H. Koeppl, IEEE Transactions on Automatic
Control 60 (2015) 1010–1022.
date_created: 2018-12-11T11:54:18Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2025-09-23T09:45:33Z
day: '01'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1109/TAC.2014.2364971
external_id:
arxiv:
- '1304.6603'
isi:
- '000351731600009'
intvolume: ' 60'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1304.6603
month: '04'
oa: 1
oa_version: Preprint
page: 1010 - 1022
publication: IEEE Transactions on Automatic Control
publication_identifier:
issn:
- 0018-9286
publication_status: published
publisher: IEEE
publist_id: '5262'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal Kullback-Leibler aggregation via information bottleneck
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 60
year: '2015'
...
---
_id: '18400'
abstract:
- lang: eng
text: We propose a method and a prototype imaging system for real-time reconstruction
of volumetric piecewise-smooth scattering media. The volume is illuminated by
a sequence of structured binary patterns emitted from a fan beam projector, and
the scattered light is collected by a two-dimensional sensor, thus creating an
under-complete set of compressed measurements. We show a fixed-complexity and
latency reconstruction algorithm capable of estimating the scattering coefficients
in real-time. We also show a simple greedy algorithm for learning the optimal
illumination patterns. Our results demonstrate faithful reconstruction from highly
compressed measurements. Furthermore, a method for compressed registration of
the measured volume to a known template is presented, showing excellent alignment
with just a single projection. Though our prototype system operates in visible
light, the presented methodology is suitable for fast x-ray scattering imaging,
in particular in real-time vascular medical imaging.
article_number: '7025264'
article_processing_charge: No
author:
- first_name: Ohad
full_name: Menashe, Ohad
last_name: Menashe
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Menashe O, Bronstein AM. Real-time compressed imaging of scattering volumes.
In: 2014 IEEE International Conference on Image Processing (ICIP). IEEE;
2015. doi:10.1109/icip.2014.7025264'
apa: 'Menashe, O., & Bronstein, A. M. (2015). Real-time compressed imaging of
scattering volumes. In 2014 IEEE International Conference on Image Processing
(ICIP). Paris, France: IEEE. https://doi.org/10.1109/icip.2014.7025264'
chicago: Menashe, Ohad, and Alex M. Bronstein. “Real-Time Compressed Imaging of
Scattering Volumes.” In 2014 IEEE International Conference on Image Processing
(ICIP). IEEE, 2015. https://doi.org/10.1109/icip.2014.7025264.
ieee: O. Menashe and A. M. Bronstein, “Real-time compressed imaging of scattering
volumes,” in 2014 IEEE International Conference on Image Processing (ICIP),
Paris, France, 2015.
ista: Menashe O, Bronstein AM. 2015. Real-time compressed imaging of scattering
volumes. 2014 IEEE International Conference on Image Processing (ICIP). IEEE International
Conference on Image Processing, 7025264.
mla: Menashe, Ohad, and Alex M. Bronstein. “Real-Time Compressed Imaging of Scattering
Volumes.” 2014 IEEE International Conference on Image Processing (ICIP),
7025264, IEEE, 2015, doi:10.1109/icip.2014.7025264.
short: O. Menashe, A.M. Bronstein, in:, 2014 IEEE International Conference on Image
Processing (ICIP), IEEE, 2015.
conference:
end_date: 2014-10-30
location: Paris, France
name: IEEE International Conference on Image Processing
start_date: 2014-10-27
date_created: 2024-10-15T11:20:54Z
date_published: 2015-01-29T00:00:00Z
date_updated: 2024-12-04T13:56:28Z
day: '29'
doi: 10.1109/icip.2014.7025264
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
publication: 2014 IEEE International Conference on Image Processing (ICIP)
publication_identifier:
eisbn:
- '9781479957514'
eissn:
- 2381-8549
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Real-time compressed imaging of scattering volumes
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '18401'
abstract:
- lang: eng
text: Intel's newly-announced low-cost RealSense 3D camera claims significantly
better precision than other currently available low-cost platforms and is expected
to become ubiquitous in laptops and mobile devices starting this year. In this
paper, we demonstrate for the first time that the RealSense camera can be easily
converted into a real low-cost gaze tracker. Gaze has become increasingly relevant
as an input for human-computer interaction due to its association with attention.
It is also critical in clinical mental health diagnosis. We present a novel 3D
gaze and fixation tracker based on the eye surface geometry captured with the
RealSense 3D camera. First, eye surface 3D point clouds are segmented to extract
the pupil center and iris using registered infrared images. With non-ellipsoid
eye surface and single fixation point assumptions, pupil centers and iris normal
vectors are used to first estimate gaze (for each eye), and then a single fixation
point for both eyes simultaneously using a RANSAC-based approach. With a simple
learned bias field correction model, the fixation tracker demonstrates mean error
of approximately 1 cm at 20-30 cm, which is sufficiently adequate for gaze and
fixation tracking in human-computer interaction and mental health diagnosis applications.
article_number: '7351256'
article_processing_charge: No
author:
- first_name: Mark
full_name: Draelos, Mark
last_name: Draelos
- first_name: Qiang
full_name: Qiu, Qiang
last_name: Qiu
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Guillermo
full_name: Sapiro, Guillermo
last_name: Sapiro
citation:
ama: 'Draelos M, Qiu Q, Bronstein AM, Sapiro G. Intel realsense = Real low cost
gaze. In: 2015 IEEE International Conference on Image Processing (ICIP).
IEEE; 2015. doi:10.1109/icip.2015.7351256'
apa: 'Draelos, M., Qiu, Q., Bronstein, A. M., & Sapiro, G. (2015). Intel realsense
= Real low cost gaze. In 2015 IEEE International Conference on Image Processing
(ICIP). Quebec City, QC, Canada: IEEE. https://doi.org/10.1109/icip.2015.7351256'
chicago: Draelos, Mark, Qiang Qiu, Alex M. Bronstein, and Guillermo Sapiro. “Intel
Realsense = Real Low Cost Gaze.” In 2015 IEEE International Conference on Image
Processing (ICIP). IEEE, 2015. https://doi.org/10.1109/icip.2015.7351256.
ieee: M. Draelos, Q. Qiu, A. M. Bronstein, and G. Sapiro, “Intel realsense = Real
low cost gaze,” in 2015 IEEE International Conference on Image Processing (ICIP),
Quebec City, QC, Canada, 2015.
ista: Draelos M, Qiu Q, Bronstein AM, Sapiro G. 2015. Intel realsense = Real low
cost gaze. 2015 IEEE International Conference on Image Processing (ICIP). IEEE
International Conference on Image Processing, 7351256.
mla: Draelos, Mark, et al. “Intel Realsense = Real Low Cost Gaze.” 2015 IEEE
International Conference on Image Processing (ICIP), 7351256, IEEE, 2015,
doi:10.1109/icip.2015.7351256.
short: M. Draelos, Q. Qiu, A.M. Bronstein, G. Sapiro, in:, 2015 IEEE International
Conference on Image Processing (ICIP), IEEE, 2015.
conference:
end_date: 2015-09-30
location: Quebec City, QC, Canada
name: IEEE International Conference on Image Processing
start_date: 2015-09-27
date_created: 2024-10-15T11:20:54Z
date_published: 2015-12-10T00:00:00Z
date_updated: 2024-12-05T08:13:05Z
day: '10'
doi: 10.1109/icip.2015.7351256
extern: '1'
language:
- iso: eng
month: '12'
oa_version: None
publication: 2015 IEEE International Conference on Image Processing (ICIP)
publication_identifier:
eisbn:
- '9781479983391'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intel realsense = Real low cost gaze
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
OA_place: repository
OA_type: green
_id: '1841'
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 Diffusion (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. The new family of algorithms can
be viewed as a generalization of TRW-S from pairwise to higher-order graphical
models. We test SRMP on several real-world problems with promising results.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 2015;37(5):919-930. doi:10.1109/TPAMI.2014.2363465
apa: Kolmogorov, V. (2015). A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2014.2363465
chicago: Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE
Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015. https://doi.org/10.1109/TPAMI.2014.2363465.
ieee: V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 37, no. 5. IEEE, pp. 919–930,
2015.
ista: Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 37(5), 919–930.
mla: Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015,
pp. 919–30, doi:10.1109/TPAMI.2014.2363465.
short: V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence
37 (2015) 919–930.
corr_author: '1'
date_created: 2018-12-11T11:54:18Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2025-09-22T14:33:14Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2014.2363465
ec_funded: 1
external_id:
arxiv:
- '1309.5655'
isi:
- '000352533000002'
intvolume: ' 37'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5655
month: '05'
oa: 1
oa_version: Preprint
page: 919 - 930
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '5261'
quality_controlled: '1'
related_material:
record:
- id: '2273'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: A new look at reweighted message passing
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 37
year: '2015'
...
---
_id: '18415'
abstract:
- lang: eng
text: Parsimony, including sparsity and low rank, has been shown to successfully
model data in numerous machine learning and signal processing tasks. Traditionally,
such modeling approaches rely on an iterative algorithm that minimizes an objective
function with parsimony-promoting terms. The inherently sequential structure and
data-dependent complexity and latency of iterative optimization constitute a major
limitation in many applications requiring real-time performance or involving large-scale
data. Another limitation encountered by these modeling techniques is the difficulty
of their inclusion in discriminative learning scenarios. In this work, we propose
to move the emphasis from the model to the pursuit algorithm, and develop a process-centric
view of parsimonious modeling, in which a learned deterministic fixed-complexity
pursuit process is used in lieu of iterative optimization. We show a principled
way to construct learnable pursuit process architectures for structured sparse
and robust low rank models, derived from the iteration of proximal descent algorithms.
These architectures learn to approximate the exact parsimonious representation
at a fraction of the complexity of the standard optimization methods. We also
show that appropriate training regimes allow to naturally extend parsimonious
models to discriminative settings. State-of-the-art results are demonstrated on
several challenging problems in image and audio processing with several orders
of magnitude speed-up compared to the exact optimization algorithms.
article_processing_charge: No
arxiv: 1
author:
- first_name: P.
full_name: Sprechmann, P.
last_name: Sprechmann
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: G.
full_name: Sapiro, G.
last_name: Sapiro
citation:
ama: Sprechmann P, Bronstein AM, Sapiro G. Learning efficient sparse and low rank
models. IEEE Transactions on Pattern Analysis and Machine Intelligence.
2015;37(9):1821-1833. doi:10.1109/tpami.2015.2392779
apa: Sprechmann, P., Bronstein, A. M., & Sapiro, G. (2015). Learning efficient
sparse and low rank models. IEEE Transactions on Pattern Analysis and Machine
Intelligence. IEEE. https://doi.org/10.1109/tpami.2015.2392779
chicago: Sprechmann, P., Alex M. Bronstein, and G. Sapiro. “Learning Efficient Sparse
and Low Rank Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2015. https://doi.org/10.1109/tpami.2015.2392779.
ieee: P. Sprechmann, A. M. Bronstein, and G. Sapiro, “Learning efficient sparse
and low rank models,” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 37, no. 9. IEEE, pp. 1821–1833, 2015.
ista: Sprechmann P, Bronstein AM, Sapiro G. 2015. Learning efficient sparse and
low rank models. IEEE Transactions on Pattern Analysis and Machine Intelligence.
37(9), 1821–1833.
mla: Sprechmann, P., et al. “Learning Efficient Sparse and Low Rank Models.” IEEE
Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 9,
IEEE, 2015, pp. 1821–33, doi:10.1109/tpami.2015.2392779.
short: P. Sprechmann, A.M. Bronstein, G. Sapiro, IEEE Transactions on Pattern Analysis
and Machine Intelligence 37 (2015) 1821–1833.
date_created: 2024-10-15T11:20:55Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2024-12-18T11:40:35Z
day: '01'
doi: 10.1109/tpami.2015.2392779
extern: '1'
external_id:
arxiv:
- '1212.3631'
pmid:
- '26353129'
intvolume: ' 37'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1212.3631
month: '09'
oa: 1
oa_version: Preprint
page: 1821-1833
pmid: 1
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
eissn:
- 1939-3539
issn:
- 0162-8828
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning efficient sparse and low rank models
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2015'
...
---
_id: '18416'
abstract:
- lang: eng
text: We construct an extension of spectral and diffusion geometry to multiple modalities
through simultaneous diagonalization of Laplacian matrices. This naturally extends
classical data analysis tools based on spectral geometry, such as diffusion maps
and spectral clustering. We provide several synthetic and real examples of manifold
learning, object classification, and clustering, showing that the joint spectral
geometry better captures the inherent structure of multi-modal data. We also show
the relation of many previous approaches for multimodal manifold analysis to our
framework.
article_processing_charge: No
author:
- first_name: Davide
full_name: Eynard, Davide
last_name: Eynard
- first_name: Artiom
full_name: Kovnatsky, Artiom
last_name: Kovnatsky
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Klaus
full_name: Glashoff, Klaus
last_name: Glashoff
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: Eynard D, Kovnatsky A, Bronstein MM, Glashoff K, Bronstein AM. Multimodal manifold
snalysis by simultaneous diagonalization of Laplacians. IEEE Transactions on
Pattern Analysis and Machine Intelligence. 2015;37(12):2505-2517. doi:10.1109/tpami.2015.2408348
apa: Eynard, D., Kovnatsky, A., Bronstein, M. M., Glashoff, K., & Bronstein,
A. M. (2015). Multimodal manifold snalysis by simultaneous diagonalization of
Laplacians. IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE. https://doi.org/10.1109/tpami.2015.2408348
chicago: Eynard, Davide, Artiom Kovnatsky, Michael M. Bronstein, Klaus Glashoff,
and Alex M. Bronstein. “Multimodal Manifold Snalysis by Simultaneous Diagonalization
of Laplacians.” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2015. https://doi.org/10.1109/tpami.2015.2408348.
ieee: D. Eynard, A. Kovnatsky, M. M. Bronstein, K. Glashoff, and A. M. Bronstein,
“Multimodal manifold snalysis by simultaneous diagonalization of Laplacians,”
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37,
no. 12. IEEE, pp. 2505–2517, 2015.
ista: Eynard D, Kovnatsky A, Bronstein MM, Glashoff K, Bronstein AM. 2015. Multimodal
manifold snalysis by simultaneous diagonalization of Laplacians. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 37(12), 2505–2517.
mla: Eynard, Davide, et al. “Multimodal Manifold Snalysis by Simultaneous Diagonalization
of Laplacians.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 37, no. 12, IEEE, 2015, pp. 2505–17, doi:10.1109/tpami.2015.2408348.
short: D. Eynard, A. Kovnatsky, M.M. Bronstein, K. Glashoff, A.M. Bronstein, IEEE
Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 2505–2517.
date_created: 2024-10-15T11:20:55Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2024-12-12T14:08:46Z
day: '01'
doi: 10.1109/tpami.2015.2408348
extern: '1'
external_id:
pmid:
- '26539854'
intvolume: ' 37'
issue: '12'
language:
- iso: eng
month: '12'
oa_version: None
page: 2505-2517
pmid: 1
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
eissn:
- 1939-3539
issn:
- 0162-8828
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multimodal manifold snalysis by simultaneous diagonalization of Laplacians
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2015'
...
---
_id: '18424'
abstract:
- lang: eng
text: We present a fast algorithm for global rigid symmetry detection with approximation
guarantees. The algorithm is guaranteed to find the best approximate symmetry
of a given shape, to within a user-specified threshold, with very high probability.
Our method uses a carefully designed sampling of the transformation space, where
each transformation is efficiently evaluated using a sublinear algorithm. We prove
that the density of the sampling depends on the total variation of the shape,
allowing us to derive formal bounds on the algorithm's complexity and approximation
quality. We further investigate different volumetric shape representations (in
the form of truncated distance transforms), and in such a way control the total
variation of the shape and hence the sampling density and the runtime of the algorithm.
A comprehensive set of experiments assesses the proposed method, including an
evaluation on the eight categories of the COSEG data set. This is the first large-scale
evaluation of any symmetry detection technique that we are aware of.
article_processing_charge: No
arxiv: 1
author:
- first_name: Simon
full_name: Korman, Simon
last_name: Korman
- first_name: Roee
full_name: Litman, Roee
last_name: Litman
- first_name: Shai
full_name: Avidan, Shai
last_name: Avidan
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Korman S, Litman R, Avidan S, Bronstein AM. Probably approximately symmetric:
Fast rigid symmetry detection with global guarantees. Computer Graphics Forum.
2015;34(1):2-13. doi:10.1111/cgf.12454'
apa: 'Korman, S., Litman, R., Avidan, S., & Bronstein, A. M. (2015). Probably
approximately symmetric: Fast rigid symmetry detection with global guarantees.
Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12454'
chicago: 'Korman, Simon, Roee Litman, Shai Avidan, and Alex M. Bronstein. “Probably
Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.”
Computer Graphics Forum. Wiley, 2015. https://doi.org/10.1111/cgf.12454.'
ieee: 'S. Korman, R. Litman, S. Avidan, and A. M. Bronstein, “Probably approximately
symmetric: Fast rigid symmetry detection with global guarantees,” Computer
Graphics Forum, vol. 34, no. 1. Wiley, pp. 2–13, 2015.'
ista: 'Korman S, Litman R, Avidan S, Bronstein AM. 2015. Probably approximately
symmetric: Fast rigid symmetry detection with global guarantees. Computer Graphics
Forum. 34(1), 2–13.'
mla: 'Korman, Simon, et al. “Probably Approximately Symmetric: Fast Rigid Symmetry
Detection with Global Guarantees.” Computer Graphics Forum, vol. 34, no.
1, Wiley, 2015, pp. 2–13, doi:10.1111/cgf.12454.'
short: S. Korman, R. Litman, S. Avidan, A.M. Bronstein, Computer Graphics Forum
34 (2015) 2–13.
date_created: 2024-10-15T11:20:55Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2024-12-19T10:12:48Z
day: '01'
doi: 10.1111/cgf.12454
extern: '1'
external_id:
arxiv:
- '1403.6637'
intvolume: ' 34'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1403.6637
month: '02'
oa: 1
oa_version: Preprint
page: 2-13
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Probably approximately symmetric: Fast rigid symmetry detection with global
guarantees'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...