Stop the war!
Остановите войну!
for scientists:
default search action
CoRR, February 2008
- Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild:
Improved Deterministic Length Reduction. - Sylvain Guillemot, François Nicolas:
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees. - Terence Chan, Alex J. Grant:
Mission impossible: Computing the network coding capacity region. - Lutz Schröder, Dirk Pattinson:
The craft of model making: PSPACE bounds for non-iterative modal logics. - Pierre Sutra, Marc Shapiro:
Fault-Tolerant Partial Replication in Large-Scale Database Systems. - Salim Y. El Rouayheb, Alexander Sprintson, Costas N. Georghiades:
On the Relation Between the Index Coding and the Network Coding Problems. - Jérôme Feret:
Partitioning the Threads of a Mobile System. - Miriam C. B. Alves, Christine C. Dantas, Nanci Naomi Arai, Rovedy B. da Silva:
A topological formal treatment for scenario-based software specification of concurrent real-time systems. - Fabrice Rossi, Brieuc Conan-Guez:
Multi-Layer Perceptrons and Symbolic Data. - Brieuc Conan-Guez, Fabrice Rossi:
Accélération des cartes auto-organisatrices sur tableau de dissimilarités par séparation et évaluation. - L. Jeganathan, Raghavan Rama, Ritabrata Sengupta:
A proposal to a generalised splicing with a self assembly approach. - Catherine Krier, Fabrice Rossi, Damien François, Michel Verleysen:
A data-driven functional projection approach for the selection of feature ranges in spectra with ICA or cluster analysis. - (Withdrawn) On the complexity of finding gapped motifs.
- Bobak Nazer, Michael Gastpar:
The Case for Structured Random Codes in Network Capacity Theorems. - (Withdrawn) Path Loss Exponent Estimation in Large Wireless Networks.
- Tommy Färnqvist, Peter Jonsson, Johan Thapper:
Approximability Distance in the Space of H-Colourability Problems. - Fang Wu, Bernardo A. Huberman:
Popularity, Novelty and Attention. - Cristian S. Calude, Marius Zimand:
Algorithmically independent sequences. - Viveck R. Cadambe, Syed Ali Jafar:
Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays, Feedback, Cooperation and Full-Duplex Operation. - Kazem Jahanbakhsh, Marzieh Hajhosseini:
Improving Performance of Cluster Based Routing Protocol using Cross-Layer Design. - Erwan Le Merrer, Vincent Gramoli, Anne-Marie Kermarrec, Aline Carneiro Viana, Marin Bertier:
Energy Aware Self-Organizing Density Management in Wireless Sensor Networks. - Vincent Gramoli, Michel Raynal:
Timed Quorum System for Large-Scale and Dynamic Environments. - Brian M. Kurkoski, Justin Dauwels:
Message-Passing Decoding of Lattices Using Gaussian Mixtures. - Frans M. J. Willems:
Rotated and Scaled Alamouti Coding. - Julien Bringer, Hervé Chabanne:
Trusted-HB: a low-cost version of HB+ secure against Man-in-The-Middle attacks. - François Nicolas:
(Generalized) Post Correspondence Problem and semi-Thue systems. - Marco Chiani, Moe Z. Win, Hyundong Shin:
MIMO Networks: the Effects of Interference. - Sander Spek:
Knowledge management by wikis. - Fred Daneshgaran, Massimiliano Laddomada, Fabio Mesiti, Marina Mondin:
Modelling and Analysis of the Distributed Coordination Function of IEEE 802.11 with Multirate Capability. - Aitor del Coso, Sébastien Simoens:
Distributed Compression for the Uplink of a Backhaul-Constrained Coordinated Cellular Network. - Abdourrahmane M. Atto, Dominique Pastor:
Central Limit Theorems for Wavelet Packet Decompositions of Stationary Random Processes. - Thierry Val, Adrien van den Bossche:
Développement et analyse multi outils d'un protocole MAC déterministe pour un réseau de capteurs sans fil. - Ping Li:
On Approximating Frequency Moments of Data Streams with Skewed Projections. - Fabio G. Guerrero, Maribell Sacanamboy:
Turbo Interleaving inside the cdma2000 and W-CDMA Mobile Communication Systems: A Tutorial. - Jonathan Hayman, Glynn Winskel:
Independence and Concurrent Separation Logic. - Enrico Paolini, Marc P. C. Fossorier, Marco Chiani:
Doubly-Generalized LDPC Codes: Stability Bound over the BEC. - Jaap-Henk Hoepman:
Distributed Double Spending Prevention. - Jaap-Henk Hoepman:
The Ephemeral Pairing Problem. - Paolo Ferragina, Igor Nitto, Rossano Venturini:
Bit-Optimal Lempel-Ziv compression. - Paul R. Gazis, Jeffrey D. Scargle:
Using Bayesian Blocks to Partition Self-Organizing Maps. - Andrew Gacek, Dale Miller, Gopalan Nadathur:
Combining generic judgments with recursive definitions. - Xavier Bry:
New Estimation Procedures for PLS Path Modelling. - Pawel Marciniak, Nikitas Liogkas, Arnaud Legout, Eddie Kohler:
Small Is Not Always Beautiful. - Benjamin Sach, Raphaël Clifford:
An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem. - Deepak Ajwani, Tobias Friedrich:
Average-Case Analysis of Online Topological Ordering. - Damien Vergnaud:
New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures. - Benoît Libert, Damien Vergnaud:
Multi-Use Unidirectional Proxy Re-Signatures. - Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil:
Snap-Stabilization in Message-Passing Systems. - Thomas Begin, Alexandre Brandwajn:
Note sur les temps de service résiduels dans les systèmes type M/G/c. - Qi Cheng, Daqing Wan:
Complexity of Decoding Positive-Rate Reed-Solomon Codes. - Qiqi Yan:
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique. - Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Orientations. - Shuheng Zhou:
Learning Balanced Mixtures of Discrete Distributions with Small Sample. - Heng Lian:
Bayesian Nonlinear Principal Component Analysis Using Random Fields. - José M. Martín-García, David Yllanes, Renato Portugal:
The Invar tensor package: Differential invariants of Riemann. - Dusko Pavlovic:
On quantum statistics in data analysis. - Dusko Pavlovic:
Network as a computer: ranking paths to find flows. - Josef Cibulka:
Untangling polygons and graphs. - Satish Babu Korada, Rüdiger L. Urbanke:
Exchange of Limits: Why Iterative Decoding Works. - Shai Gutner, Michael Tarsi:
Some results on (a:b)-choosability. - Menelaos I. Karavelas:
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs. - Yiling Chen, Lance Fortnow, Nicolas S. Lambert, David M. Pennock, Jennifer Wortman:
Complexity of Combinatorial Market Makers. - Pascal O. Vontobel:
Interior-Point Algorithms for Linear-Programming Decoding. - Yoshiyuki Kabashima:
An integral formula for large random rectangular matrices and its application to analysis of linear vector channels. - Qing Zhao, Bhaskar Krishnamachari:
Structure and Optimality of Myopic Policy in Opportunistic Access with Noisy Observations. - Haim H. Permuter, Tsachy Weissman, Jun Chen:
New Bounds for the Capacity Region of the Finite-State Multiple Access Channel. - Haim H. Permuter, Young-Han Kim, Tsachy Weissman:
On Directed Information and Gambling. - Nathalie Mitton, Katy Paroux, Bruno Sericola, Sébastien Tixeuil:
Ascending runs in dependent uniformly distributed random variables: Application to wireless networks. - Svante Janson, Christian Lavault, Guy Louchard:
Convergence of some leader election algorithms. - Clément Jonquet, Stefano A. Cerri:
Les Agents comme des interpréteurs Scheme : Spécification dynamique par la communication. - Mahesh Pal:
Extreme Learning Machine for land cover classification. - Klim Efremenko, Ely Porat:
Approximating General Metric Distances Between a Pattern and a Text. - Francis R. Bach, Jacob D. Abernethy, Jean-Philippe Vert, Theodoros Evgeniou:
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization. - Cyril Allauzen, Mehryar Mohri:
3-Way Composition of Weighted Finite-State Transducers. - Ronald de Wolf:
Error-Correcting Data Structures. - K. S. Kobylkin:
Minimal Committee Problem for Inconsistent Systems of Linear Inequalities on the Plane. - Shengtian Yang, Yan Chen, Thomas Honold, Zhaoyang Zhang, Peiliang Qiu:
Constructing Linear Codes with Good Joint Spectra. - Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu:
Universal Coding for Lossless and Lossy Complementary Delivery Problems. - Jan A. Bergstra, Kees Middelburg:
Thread extraction for polyadic instruction sequences. - Demissie B. Aredo, Mark Burgess, Simen Hagen:
Program Promises. - Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant:
On the Complexity of Nash Equilibria of Action-Graph Games. - Christian Mercat:
Discrete Complex Structure on Surfel Surfaces. - Dima Grigoriev, Vladimir Shpilrain:
Zero-knowledge authentication schemes from actions on graphs, groups, or rings. - Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Jakub Lopuszanski, Grzegorz Stachowiak:
Generalized Whac-a-Mole. - Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest paths in Planar DAGs in Unambiguous Logspace. - Omid Amini, Fedor V. Fomin, Saket Saurabh:
Parameterized Algorithms for Partial Cover Problems. - Alvaro Francisco Huertas-Rosero, Leif Azzopardi, C. J. van Rijsbergen:
Characterising through Erasing: A Theoretical Framework for Representing Documents Inspired by Quantum Theory. - Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard:
ARQ for Network Coding. - Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels. - Silvano Di Zenzo:
SAT Has No Wizards. - Yang Ding:
A Construction for Constant-Composition Codes. - Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi:
A review of the Statistical Mechanics approach to Random Optimization Problems. - Edith Hemaspaandra, Henning Schnoor:
On the Complexity of Elementary Modal Logics. - K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design. - K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
Diversity and Degrees of Freedom of Cooperative Wireless Networks. - Sudhir Kumar Singh, Vwani P. Roychowdhury:
To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ? - Uwe Aickelin, Kathryn A. Dowsland:
Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. - Ayfer Özgür, Olivier Lévêque:
Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks. - Wouter M. Koolen, Steven de Rooij:
Combining Expert Advice Efficiently. - Martin Ziegler, Wouter M. Koolen:
Kolmogorov Complexity Theory over the Reals. - Simona Settepanella:
Blocking Sets in the complement of hyperplane arrangements in projective space. - Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos:
Well-Centered Triangulation. - Manik Lal Das:
On the Security of "an efficient and complete remote user authentication scheme". - Viveck R. Cadambe, Syed Ali Jafar:
Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels. - Alexandre Riazanov:
New Implementation Framework for Saturation-Based Reasoning. - Ashkan Aazami:
Domination in graphs with bounded propagation: algorithms, formulations and hardness results. - Kevin Buchin:
Minimizing the Maximum Interference is Hard. - Mahesh Pal, Paul M. Mather:
Support Vector classifiers for Land Cover Classification. - Shai Gutner:
Choice numbers of graphs. - Jessica Franco, Laurent Carraro, Olivier Roustant, Astrid Jourdan:
A Radar-Shaped Statistic for Testing and Visualizing Uniformity Properties in Computer Experiments. - Walid Saad, Zhu Han, Mérouane Debbah, Are Hjørungnes:
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks. - Jean Cardinal, Christophe Dumeunier:
Set Covering Problems with General Objective Functions. - Murilo S. Baptista, Christiane Bohn, Reinhold Kliegl, Ralf Engbert, Jürgen Kurths:
Reconstruction of eye movements during blinks. - Stephan Kreutzer, Sebastian Ordyniak:
Digraph Decompositions and Monotonicity in Digraph Searching. - Christoph Schommer, Conny Uhde:
Textual Fingerprinting with Texts from Parkin, Bassewitz, and Leander. - Anthony J. H. Simons, Carlos Alberto Fernández y Fernández:
Using Alloy to model-check visual design notations. - Per Austrin, Elchanan Mossel:
Approximation Resistant Predicates From Pairwise Independence. - Ping Li:
Compressed Counting. - Gareth Baxter, Marcus R. Frean:
Software graphs and programmer awareness. - Christophe Prieur, Dominique Cardon, Jean-Samuel Beuscart, Nicolas Pissard, Pascal Pons:
The Stength of Weak cooperation: A Case Study on Flickr. - Ioannis Chatzigeorgiou, Ian J. Wassell, Rolando A. Carrasco:
On the Frame Error Rate of Transmission Schemes on Quasi-Static Fading Channels. - John B. Little:
Algebraic geometry codes from higher dimensional varieties. - Vaneet Aggarwal, Amir Bennatan, A. Robert Calderbank:
On Maximizing Coverage in Gaussian Relay Networks. - Pierre Comon, Jos M. F. ten Berge:
Generic and Typical Ranks of Three-Way Arrays. - Mahesh Pal:
Multiclass Approaches for Support Vector Machine Based Land Cover Classification. - Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott:
Improved Approximations for Multiprocessor Scheduling Under Uncertainty. - Oya Aran, Ismail Ari, Alexandre Benoît, Ana Huerta Carrillo, François-Xavier Fanard, Pavel Campr, Lale Akarun, Alice Caplier, Michèle Rombaut, Bülent Sankur:
Sign Language Tutoring Tool. - David Simoncini, Sébastien Vérel, Philippe Collard, Manuel Clergue:
Anisotropic selection in cellular genetic algorithms. - Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point and Aperiodic Tilings. - Georg Böcherer, Valdemar Cardoso da Rocha Jr., Cecilio Pimentel:
Capacity of General Discrete Noiseless Channels. - Georg Böcherer, Daniel Bielefeld:
Synchronization in Strictly Bandlimited Frequency Selective Ultra-Wideband Channels. - Chandra Chekuri, Nitish Korula:
Min-Cost 2-Connected Subgraphs With k Terminals. - Novella Bartolini, Gian Carlo Bongiovanni, Simone Silvestri:
Self-* overload control for distributed web systems. - Laurent Guille, Terence Chan, Alex J. Grant:
The minimal set of Ingleton inequalities. - Florence Bénézit, Alexandros G. Dimakis, Patrick Thiran, Martin Vetterli:
Order-Optimal Consensus through Randomized Path Averaging. - Menelaos I. Karavelas, Elias P. Tsigaridas:
Guarding curvilinear art galleries with vertex or point guards. - Sergey Gubin:
On Subgraph Isomorphism. - Vaneet Aggarwal:
Distributed Joint Source-Channel Coding for arbitrary memoryless correlated sources and Source coding for Markov correlated sources using LDPC codes. - Shai Gutner:
The complexity of planar graph choosability.