- home
- Advanced Search
Filters
Clear All- EDIH Adria
- Publications
- Report
- IL
- EDIH Adria
- Publications
- Report
- IL
Loading
description Publicationkeyboard_double_arrow_right Conference object , Report 2018Publisher:EasyChair Authors: Doron Benzvi; Adam Shafir;Doron Benzvi; Adam Shafir;This paper describes Independent Component Analysis (ICA) based fixed-point algorithm for the blind separation of convolutive mixture of periodical signals. The proposed algorithm extracts independent periodical sources from their mixtures in frequency domain, where they are represented by their sets of harmonics. The individual harmonics are separated by referring to narrow frequency segments of the mixed signals, which include two harmonics each at most. The algorithm offers a simple solution to the permutation problem common to source separation using ICA.
add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.29007/8qk6&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu2 citations 2 popularity Average influence Average impulse Average Powered by BIP!more_vert add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.29007/8qk6&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Report , Conference object 2018Publisher:EasyChair Sergey Edunov; Dionysios Logothetis; Cheng Wang; Avery Ching; Maja Kabiljo;Synthetic graph generators facilitate research in graph algorithms and graph processing systems by providing access to graphs that resemble real social networks while addressing privacy and security concerns. Nevertheless, their practical value lies in their ability to capture important metrics of real graphs, such as degree distribution and clustering properties. Graph generators must also be able to produce such graphs at the scale of real-world industry graphs, that is, hundreds of billions or trillions of edges.In this paper, we propose Darwini, a graph generator that captures a number of core characteristics of real graphs. Importantly, given a source graph, it can reproduce the degree distribution and, unlike existing approaches, the local clustering coefficient distribution. Furthermore, Darwini maintains a number of metrics, such as graph assortativity, eigenvalues, and others. Comparing Darwini with state-of-the-art generative models, we show that it can reproduce these characteristics more accurately. Finally, we provide an open source implementation of Darwini on the vertex-centric Apache Giraph<sup>TM</sup> model that can generate synthetic graphs with up to 3 trillion edges.
add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.29007/pmhr&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu9 citations 9 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.29007/pmhr&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article , Report , Conference object 2015 NetherlandsPublisher:Springer International Publishing Funded by:EC | CG LEARNINGEC| CG LEARNINGAdler, A.; de Berg, M.T.; Halperin, D.; Solovey, K.; Levent Atkin, H.; Amato, N.M.; Isler, V.; van der Stappen, A.F.;We consider the following motion-planning problem: we are given $ \mbi{m} $ unit discs in a simple polygon with $ \mbi{n} $ vertices, each at their own start position, and we want to move the discs to a given set of $ \mbi{m} $ target positions. Contrary to the standard (labeled) version of the problem, each disc is allowed to be moved to any target position, as long as in the end every target position is occupied. We show that this unlabeled version of the problem can be solved in $ \mbi{O(m^{2}+mn)} $ time, assuming that the start and target positions are at least some minimal distance from each other. This is in sharp contrast to the standard (labeled) and more general multi-robot motion planning problem for discs moving in a simple polygon, which is known to be strongly NP-hard.
NARCIS arrow_drop_down IEEE Transactions on Automation Science and EngineeringArticle . 2015Data sources: Eindhoven University of Technology Research PortalIEEE Transactions on Automation Science and EngineeringArticle . Part of book or chapter of bookData sources: UnpayWallIEEE Transactions on Automation Science and EngineeringArticle . 2015 . Peer-reviewedLicense: IEEE CopyrightEindhoven University of Technology Research PortalReport . 2013Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalPart of book or chapter of book . Conference object . 2015 . Peer-reviewedLicense: Springer Nature TDMhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-16595-0_1&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu33 citations 33 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert NARCIS arrow_drop_down IEEE Transactions on Automation Science and EngineeringArticle . 2015Data sources: Eindhoven University of Technology Research PortalIEEE Transactions on Automation Science and EngineeringArticle . Part of book or chapter of bookData sources: UnpayWallIEEE Transactions on Automation Science and EngineeringArticle . 2015 . Peer-reviewedLicense: IEEE CopyrightEindhoven University of Technology Research PortalReport . 2013Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalPart of book or chapter of book . Conference object . 2015 . Peer-reviewedLicense: Springer Nature TDMhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-16595-0_1&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Report 2015 FrancePublisher:Association for Computational Linguistics (ACL) Funded by:ANR | SUPERANR| SUPERAuthors: García-Durán, Alberto; Bordes, Antoine; Usunier, Nicolas;García-Durán, Alberto; Bordes, Antoine; Usunier, Nicolas;doi: 10.18653/v1/d15-1034
International audience; Performing link prediction in Knowledge Bases (KBs) with embedding-based models , like with the model TransE (Bordes et al., 2013) which represents relationships as translations in the embedding space, have shown promising results in recent years. Most of these works focused on modeling single relationships and hence do not take full advantage of the graph structure of KBs. In this paper, we propose an extension of TransE that learns to explicitly model composition of relationships via the addition of their corresponding translation vectors. We show empirically that this allows to improve performance for predicting single relationships as well as compositions of pairs of them.
https://www.aclweb.o... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationReport . 2015Full-Text: https://hal.science/hal-01167811/documentMémoires en Sciences de l'Information et de la CommunicationConference object . 2015Full-Text: https://hal.science/hal-01301243/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.18653/v1/d15-1034&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess Routeshybrid 58 citations 58 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert https://www.aclweb.o... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationReport . 2015Full-Text: https://hal.science/hal-01167811/documentMémoires en Sciences de l'Information et de la CommunicationConference object . 2015Full-Text: https://hal.science/hal-01301243/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.18653/v1/d15-1034&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Article , Preprint , Report 2011 NetherlandsPublisher:IEEE Funded by:UKRI | Bio-based solvent identif..., NWO | Convex Programming: New f...UKRI| Bio-based solvent identification and evaluation for use in polyurethane resin binders for the roofing industry ,NWO| Convex Programming: New frontiers and new applicationsBansal, N.; Feige, U.; Krauthgamer, R.; Makarychev, K.; Magarajan, V.; Naor, J.; Schwartz, R.; Ostrovsky, R.;We study graph partitioning problems from a min-max perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are where the k parts need to be of equal-size, and where they must separate a set of k given terminals. We consider a common generalization of these two problems, and design for it an $O(\sqrt{\log n\log k})$-approximation algorithm. This improves over an $O(\log^2 n)$ approximation for the second version, and roughly $O(k\log n)$ approximation for the first version that follows from other previous work. We also give an improved O(1)-approximation algorithm for graphs that exclude any fixed minor. Our algorithm uses a new procedure for solving the Small-Set Expansion problem. In this problem, we are given a graph G and the goal is to find a non-empty set $S\subseteq V$ of size $|S| \leq \rho n$ with minimum edge-expansion. We give an $O(\sqrt{\log{n}\log{(1/\rho)}})$ bicriteria approximation algorithm for the general case of Small-Set Expansion, and O(1) approximation algorithm for graphs that exclude any fixed minor. Comment: Full version of paper appearing in FOCS 2011, 29 pages
NARCIS arrow_drop_down Eindhoven University of Technology Research PortalConference object . 2011Data sources: Eindhoven University of Technology Research PortalSIAM Journal on ComputingArticle . 2014Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalReport . 2011Data sources: Eindhoven University of Technology Research Portalhttps://doi.org/10.48550/arxiv...Article . 2011License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1109/focs.2011.79&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 37 citations 37 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert NARCIS arrow_drop_down Eindhoven University of Technology Research PortalConference object . 2011Data sources: Eindhoven University of Technology Research PortalSIAM Journal on ComputingArticle . 2014Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalReport . 2011Data sources: Eindhoven University of Technology Research Portalhttps://doi.org/10.48550/arxiv...Article . 2011License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1109/focs.2011.79&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Conference object , Report , Preprint 2011 NetherlandsPublisher:IEEE Funded by:EC | ACUITY, NSF | Polyhedral Techniques for...EC| ACUITY ,NSF| Polyhedral Techniques for the Design of Approximation AlgorithmsBansal, N.; Buchbinder, N.; Madry, A.; Naor, J.; Ostrovsky, R.;We give the first polylogarithmic-competitive randomized online algorithm for the k -server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log 3 n log 2 k ) for any metric space on n points. Our algorithm improves upon the deterministic (2 k -1)-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of n .
NARCIS arrow_drop_down Eindhoven University of Technology Research PortalReport . 2011Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalConference object . 2011Data sources: Eindhoven University of Technology Research Portalhttps://doi.org/10.48550/arxiv...Article . 2011License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1109/focs.2011.63&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess Routesbronze 57 citations 57 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert NARCIS arrow_drop_down Eindhoven University of Technology Research PortalReport . 2011Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalConference object . 2011Data sources: Eindhoven University of Technology Research Portalhttps://doi.org/10.48550/arxiv...Article . 2011License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1109/focs.2011.63&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Article , Report 1996Publisher:Defense Technical Information Center Authors: David Doermann; Ehud Rivlin; Azriel Rosenfeld;David Doermann; Ehud Rivlin; Azriel Rosenfeld;Abstract The purpose of a document is to facilitate the transfer of information from its author to its readers. It is the author's job to design the document so that the information it contains can be interpreted accurately and efficiently. To do this, the author can make use of a set of stylistic tools. In this paper, we introduce the concept of document functionality, which attempts to describe the roles of documents and their components in the process of transferring information. A functional description of a document provides insight into the type of the document, into its intended uses, and into strategies for automatic document interpretation and retrieval. To demonstrate these ideas, we define a taxonomy of functional document components and show how functional descriptions can be used to reverse-engineer the intentions of the author, to navigate in document space, and to provide important contextual information to aid in interpretation.
Image and Vision Com... arrow_drop_down Image and Vision ComputingArticle . 1998 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.21236/ada458794&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu33 citations 33 popularity Average influence Top 10% impulse Average Powered by BIP!more_vert Image and Vision Com... arrow_drop_down Image and Vision ComputingArticle . 1998 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.21236/ada458794&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu
Loading
description Publicationkeyboard_double_arrow_right Conference object , Report 2018Publisher:EasyChair Authors: Doron Benzvi; Adam Shafir;Doron Benzvi; Adam Shafir;This paper describes Independent Component Analysis (ICA) based fixed-point algorithm for the blind separation of convolutive mixture of periodical signals. The proposed algorithm extracts independent periodical sources from their mixtures in frequency domain, where they are represented by their sets of harmonics. The individual harmonics are separated by referring to narrow frequency segments of the mixed signals, which include two harmonics each at most. The algorithm offers a simple solution to the permutation problem common to source separation using ICA.
add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.29007/8qk6&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu2 citations 2 popularity Average influence Average impulse Average Powered by BIP!more_vert add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.29007/8qk6&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Report , Conference object 2018Publisher:EasyChair Sergey Edunov; Dionysios Logothetis; Cheng Wang; Avery Ching; Maja Kabiljo;Synthetic graph generators facilitate research in graph algorithms and graph processing systems by providing access to graphs that resemble real social networks while addressing privacy and security concerns. Nevertheless, their practical value lies in their ability to capture important metrics of real graphs, such as degree distribution and clustering properties. Graph generators must also be able to produce such graphs at the scale of real-world industry graphs, that is, hundreds of billions or trillions of edges.In this paper, we propose Darwini, a graph generator that captures a number of core characteristics of real graphs. Importantly, given a source graph, it can reproduce the degree distribution and, unlike existing approaches, the local clustering coefficient distribution. Furthermore, Darwini maintains a number of metrics, such as graph assortativity, eigenvalues, and others. Comparing Darwini with state-of-the-art generative models, we show that it can reproduce these characteristics more accurately. Finally, we provide an open source implementation of Darwini on the vertex-centric Apache Giraph<sup>TM</sup> model that can generate synthetic graphs with up to 3 trillion edges.
add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.29007/pmhr&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu9 citations 9 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.29007/pmhr&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article , Report , Conference object 2015 NetherlandsPublisher:Springer International Publishing Funded by:EC | CG LEARNINGEC| CG LEARNINGAdler, A.; de Berg, M.T.; Halperin, D.; Solovey, K.; Levent Atkin, H.; Amato, N.M.; Isler, V.; van der Stappen, A.F.;We consider the following motion-planning problem: we are given $ \mbi{m} $ unit discs in a simple polygon with $ \mbi{n} $ vertices, each at their own start position, and we want to move the discs to a given set of $ \mbi{m} $ target positions. Contrary to the standard (labeled) version of the problem, each disc is allowed to be moved to any target position, as long as in the end every target position is occupied. We show that this unlabeled version of the problem can be solved in $ \mbi{O(m^{2}+mn)} $ time, assuming that the start and target positions are at least some minimal distance from each other. This is in sharp contrast to the standard (labeled) and more general multi-robot motion planning problem for discs moving in a simple polygon, which is known to be strongly NP-hard.
NARCIS arrow_drop_down IEEE Transactions on Automation Science and EngineeringArticle . 2015Data sources: Eindhoven University of Technology Research PortalIEEE Transactions on Automation Science and EngineeringArticle . Part of book or chapter of bookData sources: UnpayWallIEEE Transactions on Automation Science and EngineeringArticle . 2015 . Peer-reviewedLicense: IEEE CopyrightEindhoven University of Technology Research PortalReport . 2013Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalPart of book or chapter of book . Conference object . 2015 . Peer-reviewedLicense: Springer Nature TDMhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-16595-0_1&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu33 citations 33 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert NARCIS arrow_drop_down IEEE Transactions on Automation Science and EngineeringArticle . 2015Data sources: Eindhoven University of Technology Research PortalIEEE Transactions on Automation Science and EngineeringArticle . Part of book or chapter of bookData sources: UnpayWallIEEE Transactions on Automation Science and EngineeringArticle . 2015 . Peer-reviewedLicense: IEEE CopyrightEindhoven University of Technology Research PortalReport . 2013Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalPart of book or chapter of book . Conference object . 2015 . Peer-reviewedLicense: Springer Nature TDMhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-16595-0_1&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Report 2015 FrancePublisher:Association for Computational Linguistics (ACL) Funded by:ANR | SUPERANR| SUPERAuthors: García-Durán, Alberto; Bordes, Antoine; Usunier, Nicolas;García-Durán, Alberto; Bordes, Antoine; Usunier, Nicolas;doi: 10.18653/v1/d15-1034
International audience; Performing link prediction in Knowledge Bases (KBs) with embedding-based models , like with the model TransE (Bordes et al., 2013) which represents relationships as translations in the embedding space, have shown promising results in recent years. Most of these works focused on modeling single relationships and hence do not take full advantage of the graph structure of KBs. In this paper, we propose an extension of TransE that learns to explicitly model composition of relationships via the addition of their corresponding translation vectors. We show empirically that this allows to improve performance for predicting single relationships as well as compositions of pairs of them.
https://www.aclweb.o... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationReport . 2015Full-Text: https://hal.science/hal-01167811/documentMémoires en Sciences de l'Information et de la CommunicationConference object . 2015Full-Text: https://hal.science/hal-01301243/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.18653/v1/d15-1034&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess Routeshybrid 58 citations 58 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert https://www.aclweb.o... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationReport . 2015Full-Text: https://hal.science/hal-01167811/documentMémoires en Sciences de l'Information et de la CommunicationConference object . 2015Full-Text: https://hal.science/hal-01301243/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.18653/v1/d15-1034&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Article , Preprint , Report 2011 NetherlandsPublisher:IEEE Funded by:UKRI | Bio-based solvent identif..., NWO | Convex Programming: New f...UKRI| Bio-based solvent identification and evaluation for use in polyurethane resin binders for the roofing industry ,NWO| Convex Programming: New frontiers and new applicationsBansal, N.; Feige, U.; Krauthgamer, R.; Makarychev, K.; Magarajan, V.; Naor, J.; Schwartz, R.; Ostrovsky, R.;We study graph partitioning problems from a min-max perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are where the k parts need to be of equal-size, and where they must separate a set of k given terminals. We consider a common generalization of these two problems, and design for it an $O(\sqrt{\log n\log k})$-approximation algorithm. This improves over an $O(\log^2 n)$ approximation for the second version, and roughly $O(k\log n)$ approximation for the first version that follows from other previous work. We also give an improved O(1)-approximation algorithm for graphs that exclude any fixed minor. Our algorithm uses a new procedure for solving the Small-Set Expansion problem. In this problem, we are given a graph G and the goal is to find a non-empty set $S\subseteq V$ of size $|S| \leq \rho n$ with minimum edge-expansion. We give an $O(\sqrt{\log{n}\log{(1/\rho)}})$ bicriteria approximation algorithm for the general case of Small-Set Expansion, and O(1) approximation algorithm for graphs that exclude any fixed minor. Comment: Full version of paper appearing in FOCS 2011, 29 pages
NARCIS arrow_drop_down Eindhoven University of Technology Research PortalConference object . 2011Data sources: Eindhoven University of Technology Research PortalSIAM Journal on ComputingArticle . 2014Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalReport . 2011Data sources: Eindhoven University of Technology Research Portalhttps://doi.org/10.48550/arxiv...Article . 2011License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1109/focs.2011.79&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 37 citations 37 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert NARCIS arrow_drop_down Eindhoven University of Technology Research PortalConference object . 2011Data sources: Eindhoven University of Technology Research PortalSIAM Journal on ComputingArticle . 2014Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalReport . 2011Data sources: Eindhoven University of Technology Research Portalhttps://doi.org/10.48550/arxiv...Article . 2011License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1109/focs.2011.79&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Conference object , Report , Preprint 2011 NetherlandsPublisher:IEEE Funded by:EC | ACUITY, NSF | Polyhedral Techniques for...EC| ACUITY ,NSF| Polyhedral Techniques for the Design of Approximation AlgorithmsBansal, N.; Buchbinder, N.; Madry, A.; Naor, J.; Ostrovsky, R.;We give the first polylogarithmic-competitive randomized online algorithm for the k -server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log 3 n log 2 k ) for any metric space on n points. Our algorithm improves upon the deterministic (2 k -1)-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of n .
NARCIS arrow_drop_down Eindhoven University of Technology Research PortalReport . 2011Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalConference object . 2011Data sources: Eindhoven University of Technology Research Portalhttps://doi.org/10.48550/arxiv...Article . 2011License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1109/focs.2011.63&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess Routesbronze 57 citations 57 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert NARCIS arrow_drop_down Eindhoven University of Technology Research PortalReport . 2011Data sources: Eindhoven University of Technology Research PortalEindhoven University of Technology Research PortalConference object . 2011Data sources: Eindhoven University of Technology Research Portalhttps://doi.org/10.48550/arxiv...Article . 2011License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1109/focs.2011.63&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Article , Report 1996Publisher:Defense Technical Information Center Authors: David Doermann; Ehud Rivlin; Azriel Rosenfeld;David Doermann; Ehud Rivlin; Azriel Rosenfeld;Abstract The purpose of a document is to facilitate the transfer of information from its author to its readers. It is the author's job to design the document so that the information it contains can be interpreted accurately and efficiently. To do this, the author can make use of a set of stylistic tools. In this paper, we introduce the concept of document functionality, which attempts to describe the roles of documents and their components in the process of transferring information. A functional description of a document provides insight into the type of the document, into its intended uses, and into strategies for automatic document interpretation and retrieval. To demonstrate these ideas, we define a taxonomy of functional document components and show how functional descriptions can be used to reverse-engineer the intentions of the author, to navigate in document space, and to provide important contextual information to aid in interpretation.
Image and Vision Com... arrow_drop_down Image and Vision ComputingArticle . 1998 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.21236/ada458794&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu33 citations 33 popularity Average influence Top 10% impulse Average Powered by BIP!more_vert Image and Vision Com... arrow_drop_down Image and Vision ComputingArticle . 1998 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.21236/ada458794&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu