Search results for "CTW"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
47	Mattias Andersson 0001, Ali A. Zaidi, Niklas Wernersson, Mikael Skoglund	Nonlinear distributed sensing for closed-loop control over Gaussian channels.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Peter Bjørn Jørgensen, Thomas L. Hansen, Troels B. Sørensen, Gilberto Berardinelli	Implementation of LTE SC-FDMA on the USRP2 software defined radio platform.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Michail Matthaiou, Nestor D. Chatzidiamantis, Himal A. Suraweera, George K. Karagiannidis	Performance analysis of space-time block codes over generalized-K fading MIMO channels.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Prajwol Kumar Nakarmi, John Preuß Mattsson, Gerald Q. Maguire Jr.	Evaluation of VoIP media security for smartphones in the context of IMS.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Babak Nikfar, Setareh Maghsudi	A new bandwidth allocation scheme for dual-hop transmission using virtual oligopoly market model and Cournot competition.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Seyed Reza Abdollahi, Hamed S. Al-Raweshidy, Alieh Ahmadinia, Rajagopal Nilavalan	An All-photonic Digital Radio over Fiber architecture.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Saltanat M. Khamit	Market-based spectrum sharing in capacity-limited heterogeneous wireless networks.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Hien Quoc Ngo, Trung Quang Duong, Erik G. Larsson	Uplink performance analysis of multicell MU-MIMO with zero-forcing receivers and perfect CSI.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Tumula V. K. Chaitanya, Erik G. Larsson	Optimal resource allocation for IR-HARQ.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Javad Afshar Jahanshahi, Mohammad Eslami	On the performance of SVM based jamming attacks detection algorithm in base station.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Dennis Sundman, Saikat Chatterjee, Mikael Skoglund	Look ahead parallel pursuit.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Kittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund	Capacity of the channel with action-dependent state and reversible input.	Swe-CTW	2011	DBLP DOI BibTeX RDF
47	Sandis Spolitis, Girts Ivanovs	Extending the reach of DWDM-PON access network using chromatic dispersion compensation.	Swe-CTW	2011	DBLP DOI BibTeX RDF
45	Armin Fügenschuh, Alexander Martin 0001, Peter Stöveken	Integrated Optimization of School Starting Times and Public Bus Services.	OR	2004	DBLP DOI BibTeX RDF
45	Carl Tropper, Khalil El-Khatib	On Metrics for the Dynamic Load Balancing of Optimistic Simulations.	HICSS	1999	DBLP DOI BibTeX RDF
37	Nicklas Ekstrand, Ben J. M. Smeets	Some Notes on the Context Mapping Function in Lossless Data Compression.	Data Compression Conference	2000	DBLP DOI BibTeX RDF	context mapping function, CMF, context tree weighting, CTW, context selection, simulated annealing, combinatorial optimization, lossless data compression, lossless image compression
30	Quan Feng, Liang Luo, Xiaoqian Zhang, Yufeng Chen	CTW-Net: A Deeper Multiscale Feature Fusion W-Shaped Network for Medical Image Segmentation.	CCIS	2023	DBLP DOI BibTeX RDF
30	Peitian Ma, Zhen Liu, Junhao Zheng, Linghao Wang, Qianli Ma 0001	CTW: Confident Time-Warping for Time-Series Label-Noise Learning.	IJCAI	2023	DBLP DOI BibTeX RDF
30	Fabio Furini, Amélie Lambert, Lucas Létocart, Leo Liberti, Emiliano Traversi	Preface: CTW 2018.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
30	Bodo Manthey, Johann L. Hurink	Preface: 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019).	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
30	Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin	Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017).	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
30	Alberto Ceselli, Roberto Cordone	14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016).	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
30	Ekrem Duman, Ali Fuat Alkaya, Stefan Pickl, Ulrich Faigle	Preface: 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015).	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
30	Johann L. Hurink, Bodo Manthey	12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013).	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
30	Pietro Carlo Cacciabue, Oliver M. J. Carsten, Frédéric Vanderhaegen	Is there still a need for CTW?	Cogn. Technol. Work.	2014	DBLP DOI BibTeX RDF
30	Ulrich Faigle, Rainer Schrader	9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010).	Discret. Appl. Math.	2013	DBLP DOI BibTeX RDF
30	Sonia Cafieri, Ulrich Faigle, Leo Liberti	8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009).	Discret. Appl. Math.	2011	DBLP DOI BibTeX RDF
30	Ulrich Faigle, Johann L. Hurink	Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
30	Ulrich Faigle, Rainer Schrader, Rüdiger Schultz	Preface on CTW 2006.	Math. Methods Oper. Res.	2009	DBLP DOI BibTeX RDF
30	John R. Wilson, Beverley J. Norris	Editorial: CTW special issue on rail human factors.	Cogn. Technol. Work.	2006	DBLP DOI BibTeX RDF
30	Pietro Carlo Cacciabue	CTW special issue on human-centred design in automotive systems.	Cogn. Technol. Work.	2006	DBLP DOI BibTeX RDF
30	Erik Hollnagel, Pietro Carlo Cacciabue	The ISI and the CTW.	Cogn. Technol. Work.	2005	DBLP DOI BibTeX RDF
30	Chung-Ming Huang, Ming-Yuhe Jang, Y. C. Chao	CTW: an integrated computer and telephone-accessed WWW system.	Softw. Pract. Exp.	2000	DBLP DOI BibTeX RDF
30	Joe Suzuki	A CTW Scheme for Non-Tree Sources.	Data Compression Conference	1996	DBLP DOI BibTeX RDF
23	Jiming Yu, Sergio Verdú	Universal Estimation of Erasure Entropy.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
23	Jiming Yu, Sergio Verdú	Universal Lossless Compression of Erased Symbols.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
23	Haixiao Cai, Sanjeev R. Kulkarni, Sergio Verdú	An Algorithm for Universal Lossless Compression With Side Information.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
23	Charles G. Boncelet Jr.	Lossless Image Compression with BCTW.	ICIP	2006	DBLP DOI BibTeX RDF
23	G. Sampath	A Block Coding Method that Leads to Significantly Lower Entropy Values for the Proteins and Coding Sections of Haemophilus influenzae.	CSB	2003	DBLP DOI BibTeX RDF
23	Eitan Federovsky, Meir Feder, Shlomo Weiss	Branch Prediction Based on Universal Data Compression Algorithms.	ISCA	1998	DBLP DOI BibTeX RDF
18	Christopher Hojny, Marc E. Pfetsch	Symmetry Handling via Symmetry Breaking Polytopes.	CTW	2015	DBLP BibTeX RDF
18	Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi	Mathematical programming algorithms for spatial cloaking.	CTW	2015	DBLP BibTeX RDF
18	Alain Quilliot	An Assignment Problem with Compactness Requirements: Models and Algorithms.	CTW	2015	DBLP BibTeX RDF
18	Alexander Apke, Rainer Schrader	On the non-unit count of interval graphs.	CTW	2015	DBLP BibTeX RDF
18	Corinna Gottschalk, Britta Peis	Submodular Function Maximization on the Bounded Integer Lattice.	CTW	2015	DBLP BibTeX RDF
18	Edy Tri Baskoro	Graphs with certain locating-chromatic number.	CTW	2015	DBLP BibTeX RDF
18	Didem Gözüpek, Mordechai Shalom	Edge Coloring with Minimum Reload/Changeover Costs.	CTW	2015	DBLP BibTeX RDF
18	Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza	The P3-Convexity in the Complementary Prism of a Graph.	CTW	2015	DBLP BibTeX RDF
18	Tiziana Calamoneri, Angelo Monti, Rossella Petreschi	Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract).	CTW	2015	DBLP BibTeX RDF
18	Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan	An Extension of Dirac's Theorem on Hamiltonicity.	CTW	2015	DBLP BibTeX RDF
18	Andrei Braga, Cid C. de Souza, Orlando Lee	Computing Bounds for Eternal Domination.	CTW	2015	DBLP BibTeX RDF
18	Esther Mohr	Competitive Analysis of the Storage Management Problem.	CTW	2015	DBLP BibTeX RDF
18	Kahina Meslem, Sylvain Gravier, Souad Slimani	Distinguishing Number and Circulant Graphs.	CTW	2015	DBLP BibTeX RDF
18	Maurice Queyranne, Laurence A. Wolsey	Modeling Poset Convex Subsets.	CTW	2015	DBLP BibTeX RDF
18	Dmitrii Lozovanu, Stefan Pickl	Determining Nash Equilibria for Dynamic Positional Games on Networks.	CTW	2015	DBLP BibTeX RDF
18	Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos	Facet-defining inequalities for the representatives k-fold coloring polytope.	CTW	2015	DBLP BibTeX RDF
18	Alain Quilliot	Coloring Interval Graphs while Minimizing End-Point Number.	CTW	2015	DBLP BibTeX RDF
18	Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter	Polynomial time algorithm for the k-in-a-tree problem on chordal graphs.	CTW	2015	DBLP BibTeX RDF
18	Andrea Bettinelli, Sandro Bosio, Valentina Cacchiani	Heuristic Solutions to a Mailroom Inserting Machine Planning Problem.	CTW	2015	DBLP BibTeX RDF
18	Okan Örsan Özener	Solving the Integrated Shipment Routing Problem of a LTL Carrier.	CTW	2015	DBLP BibTeX RDF
18	Denis Cornaz, Fabio Furini, Enrico Malaguti	Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems.	CTW	2015	DBLP BibTeX RDF
18	Mohamed Amine Boutiche	Forwarding Indices of Some Subdivision Graphs.	CTW	2015	DBLP BibTeX RDF
18	Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi	Convex recoloring: inapproximability and a polyhedral study.	CTW	2015	DBLP BibTeX RDF
18	Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti	Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.	CTW	2015	DBLP BibTeX RDF
18	M. A. Shalu, S. Devi Yamini	c^2-join of graphs.	CTW	2015	DBLP BibTeX RDF
18	Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom	Equimatchable Graphs are C_2k+1-free for k ≥ 4.	CTW	2015	DBLP BibTeX RDF
18	Kamiel Cornelissen, Bodo Manthey	Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm.	CTW	2015	DBLP BibTeX RDF
18	Daniel Freund 0001, David P. Williamson	MC4, Copeland and restart probabilities.	CTW	2015	DBLP BibTeX RDF
18	Nader H. Bshouty, Ali Z. Abdi	Lower Bounds for Cover-Free Families.	CTW	2015	DBLP BibTeX RDF
18	Boting Yang	Algorithmic Aspects of the Positive Semidefinite Zero Forcing.	CTW	2015	DBLP BibTeX RDF
18	Huda Chuangpishit, Jeannette C. M. Janssen	Recognition of certain square geometric graphs.	CTW	2015	DBLP BibTeX RDF
18	Suhadi Wido Saputro	The locating chromatic number of (n-3)-regular graphs.	CTW	2015	DBLP BibTeX RDF
18	Chuan Xu 0002, Alexei A. Gaivoronski, Abdel Lisser	Stochastic bilevel network design problems.	CTW	2015	DBLP BibTeX RDF
18	Katarzyna E. Paluch 0001	Balanced matchings, unbalanced ones and related problems.	CTW	2015	DBLP BibTeX RDF
18	Gülnaz Boruzanli, John Baptist Gauci	Super Connectivity of Generalized Petersen Graphs.	CTW	2015	DBLP BibTeX RDF
18	Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras	Minimum Cost Noncrossing Flow Problem on a Layered Network.	CTW	2015	DBLP BibTeX RDF
18	Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta	On the decomposition of quaternary signed-graphic matroids.	CTW	2015	DBLP BibTeX RDF
18	Ali Haydar Özer	Double Auction with Limited Cover Money Model.	CTW	2015	DBLP BibTeX RDF
18	Vikas Vikram Singh, Oualid Jouini, Abdel Lisser	Bi-matrix Game with Random Payoffs.	CTW	2015	DBLP BibTeX RDF
18	Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier	Timber Game with Caterpillars.	CTW	2015	DBLP BibTeX RDF
18	M. Selcuk Korkmaz, Serol Bulkan, Ekrem Duman	A New TDVRP (Time Dependent Vehicle Routing Problem) Model and its Solution by Genetic Algorithm.	CTW	2015	DBLP BibTeX RDF
18	Monia Bellalouna, Walid Khaznaji, Mohamed Abdellahi Amar	A Snail Heuristic for the Euclidean Traveling Salesman Problem.	CTW	2015	DBLP BibTeX RDF
18	Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo	Sorting Separable Permutations by Restricted Multi-break Rearrangements.	CTW	2015	DBLP BibTeX RDF
18	Marvin Künnemann, Bodo Manthey	On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP.	CTW	2015	DBLP BibTeX RDF
18	Gustavo Dias, Leo Liberti, Nelson Maculan	Modelling Rank Constraints in Mathematical Programming.	CTW	2015	DBLP BibTeX RDF
18	Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks	Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs.	CTW	2015	DBLP BibTeX RDF
18	Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein	On the forbidden induced subgraph probe problem.	CTW	2015	DBLP BibTeX RDF
18	Alessandro Hill, Edna Ayako Hoshino	A branch and price algorithm for the capacitated ring tree problem.	CTW	2015	DBLP BibTeX RDF
18	Zied Bouyahia, Monia Bellalouna, Khaled Ghédira	Stability of probablisitic two-stage permutation flowshop problem.	CTW	2015	DBLP BibTeX RDF
18	Marc Demange, Tínaz Ekim, Bernard Ries	On the Minimum and Maximum Selective Graph Coloring Problems.	CTW	2015	DBLP BibTeX RDF
18	Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler	Locating-dominating sets in some families of split graphs.	CTW	2015	DBLP BibTeX RDF
18	Lucila M. S. Bento, Davidson R. Boccardo, Raphael Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter	The Graphs of Structured Programming.	CTW	2015	DBLP BibTeX RDF
18	Ramazan Algin, Ali Fuat Alkaya, Vural Aksakalli	Performance Comparison of Metaheuristics for the Obstacle Neutralization Problem.	CTW	2015	DBLP BibTeX RDF
18	David Juedes, Jeffrey Jones	A Generic Framework for Approximation Analysis for Algorithms for Star Bicoloring.	CTW	2015	DBLP BibTeX RDF
18	Isma Bouchemakh, Ibrahim Boufelgha, Meriem Moulay	Broadcasts in Complementary Prisms.	CTW	2015	DBLP BibTeX RDF
18	Ekrem Duman, Ali Fuat Alkaya (eds.)	13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, May 26-28, 2015.	CTW	2015	DBLP BibTeX RDF
18	Goksen Bacak-Turan, Ferhan Nihan Altundag	Neighbor Rupture Degree of a Graph with Maximum Connectivity.	CTW	2015	DBLP BibTeX RDF
18	Felipe De Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo de Alencar Hausen, Uéverton dos Santos Souza	On Hamiltonian Cycles in Kneser Graphs.	CTW	2015	DBLP BibTeX RDF
18	Mustafa Agaoglu, Ekrem Duman, A. Hande Erol Binguler	Approaches for optimizing cross-sell and up-sell opportunities in campaigns.	CTW	2015	DBLP BibTeX RDF
18	Méziane Aïder, Sylvain Gravier, Souad Slimani	Relaxed Locally Identifying Coloring of Graphs.	CTW	2015	DBLP BibTeX RDF