default search action
CoRR, July 2008
- David Eppstein:
Finding Large Clique Minors is Hard. - Marko A. Rodriguez, Johan Bollen, Herbert Van de Sompel:
Automatic Metadata Generation using Associative Networks. - Youjian Liu:
A Simple Converse Proof and a Unified Capacity Formula for Channels with Input Constraints. - Yuri Arkhipkin:
Quantitative Paradigm of Software Reliability as Content Relevance. - S. V. N. Vishwanathan, Karsten M. Borgwardt, Imre Risi Kondor, Nicol N. Schraudolph:
Graph Kernels. - Ioannis Chatzigiannakis, Paul G. Spirakis:
The Dynamics of Probabilistic Population Protocols. - Arkadiy Khandjian:
Increase of Software Safety. - Thomas Unger, Nadya Markin:
Quadratic Forms and Space-Time Block Codes from Generalized Quaternion and Biquaternion Algebras. - R. N. Krishnakumar, Naveen Naveen, P. Vijay Kumar:
Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks. - Sariel Har-Peled, S. Muthukrishnan:
Range Medians. - Jing Liu, Jian-Kang Zhang, Kon Max Wong:
Full Diversity Codes for MISO Systems Equipped with Linear or ML Detectors. - Dmytro V. Lande, V. V. Zhygalo:
About the creation of a parallel bilingual corpora of web-publications. - Jirí Matousek, Martin Tancer, Uli Wagner:
Hardness of embedding simplicial complexes in Rd. - Emanuel Diamant:
Unveiling the mystery of visual information processing in human brain. - Song Yean Cho, Cédric Adjih:
Wireless Broadcast with Network Coding in Mobile Ad-Hoc Networks: DRAGONCAST. - Chính T. Hoàng:
On the complexity of finding a sun in a graph. - Daowen Qiu:
Research report: State complexity of operations on two-way quantum finite automata. - Gabriel Nivasch:
Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations. - Miklós Antal, László Balogh:
Modeling belief systems with scale-free networks. - Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of Multiple Coverings into More Parts. - Mark F. Flanagan:
Linear-Programming Receivers. - Henk D. L. Hollmann:
Nonstandard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. - João P. Vilela, Luísa Lima, João Barros:
Lightweight Security for Network Coding. - Christian Tanguy:
Asymptotic Mean Time To Failure and Higher Moments for Large, Recursive Networks. - Arnaud Martin:
Belief decision support and reject for textured images characterization. - Christian Tanguy:
Exact two-terminal reliability of some directed networks. - Christos Koufogiannakis, Neal E. Young:
Flooding Overcomes Small Covering Constraints. - Pierrick Burgain, Eric Feron, John-Paul Clarke:
Collaborative Virtual Queue: Fair Management of Congested Departure Operations and Benefit Analysis. - Mark Burgin:
Algorithmic Problem Complexity. - Marina Knyazhansky, Tatjana L. Plotkin:
Knowledge bases over algebraic models. Some notes about informational equivalence. - Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
The Parikh functions of sparse context-free languages are quasi-polynomials. - Bhavana Kanukurthi, Leonid Reyzin:
An Improved Robust Fuzzy Extractor. - Mustaq Ahmed, Anna Lubiw:
Shortest Paths Avoiding Forbidden Subpaths. - Salim Y. El Rouayheb, Emina Soljanin:
On Wiretap Networks II. - Saeed Akhavan-Astaneh, Saeed Gazor, Hamid Behroozi:
On the Capacity of Pairwise Collaborative Networks. - Xenofontas A. Dimitropoulos, M. Ángeles Serrano, Dmitri V. Krioukov:
On Cycles in AS Relationships. - Fionn Murtagh:
The Correspondence Analysis Platform for Uncovering Deep Structure in Data and Information. - Denis Xavier Charles, Kumar Chellapilla:
Bloomier Filters: A second look. - Vinod M. Prabhakaran, Krishnan Eswaran, Kannan Ramchandran:
Secrecy via Sources and Channels -- A Secret Key - Secret Message Rate Trade-off Region. - Alexis Darrasse:
Random XML sampling the Boltzmann way. - Damien Hardy, Isabelle Puaut:
WCET analysis of multi-level set-associative instruction caches. - Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva:
A General Framework for Sound and Complete Floyd-Hoare Logics. - Nitish Korula, Martin Pal:
Algorithms for Secretary Problems on Graphs and Hypergraphs. - Wei-jen Hsu, Debojyoti Dutta, Ahmed Helmy:
CSI: A Paradigm for Behavior-oriented Delivery Services in Mobile Human Networks. - Abhay T. Subramanian, Andrew Thangaraj:
A Simple Algebraic Formulation for the Scalar Linear Network Coding Problem. - Charles Shen, Henning Schulzrinne, Erich M. Nahum:
Session Initiation Protocol (SIP) Server Overload Control: Design and Evaluation. - Charles Shen, Henning Schulzrinne:
Measurement and Evaluation of ENUM Server Performance. - Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu:
Timed Parity Games: Complexity and Robustness. - Charles Shen, Henning Schulzrinne:
A VoIP Privacy Mechanism and its Application in VoIP Peering for Voice Service Provider Topology and Identity Hiding. - Rohit Chadha, Mahesh Viswanathan:
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes. - James Cheney:
Flux: FunctionaL Updates for XML (extended report). - Haim Kaplan, Natan Rubin, Micha Sharir:
Line Transversals of Convex Polyhedra in R3. - Michele Garetto, Emilio Leonardi:
Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks. - Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan:
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity. - David Gamarnik, David A. Goldberg:
Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections. - Dominik Scheder:
Satisfiability of Almost Disjoint CNF Formulas. - Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál:
General Auction Mechanism for Search Advertising. - Yingda Chen, Shalinee Kishore:
On the Tradeoffs of Implementing Randomized Network Coding in Multicast Networks. - Danilo Silva, Frank R. Kschischang, Ralf Kötter:
Capacity of Random Network Coding under a Probabilistic Error Model. - Vikraman Arvind, Partha Mukhopadhyay:
Quantum Query Complexity of Multilinear Identity Testing. - Maziar M. Nekovee:
Simulations of Large-scale WiFi-based Wireless Networks: Interdisciplinary Challenges and Applications. - Matteo Gagliolo, Jürgen Schmidhuber:
Algorithm Selection as a Bandit Problem with Unbounded Losses. - Navin Goyal, Luis Rademacher, Santosh S. Vempala:
Expanders via Random Spanning Trees. - Philippe Dumas:
Mean asymptotic behaviour of radix-rational sequences and dilation equations (Extended version). - Yves Bertot, Ekaterina Komendantskaya:
Inductive and Coinductive Components of Corecursive Functions in Coq. - Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
On the Capacity of MIMO Interference Channels. - Vahed Qazvinian, Dragomir R. Radev:
Scientific Paper Summarization Using Citation Summary Networks. - Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo:
A Radar for the Internet. - A. V. Toporensky:
Quasi-Mandelbrot sets for perturbed complex analytic maps: visual patterns. - Milad Niqui:
Coinductive Formal Reasoning in Exact Real Arithmetic. - Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo, Yves Robert:
Resource Allocation Strategies for In-Network Stream Processing. - Daniel Lemire:
Faster Sequential Search with a Two-Pass Dynamic-Time-Warping Lower Bound. - Julien Clément, Xavier Défago, Maria Gradinariu Potop-Butucaru, Stéphane Messika:
The cost of probabilistic gathering in oblivious robot networks. - Renato J. O. Figueiredo, P. Oscar Boykin, José A. B. Fortes, Tao Li, Jie-Kwon Peir, David Wolinsky, Lizy Kurian John, David R. Kaeli, David J. Lilja, Sally A. McKee, Gokhan Memik, Alain Roy, Gary S. Tyson:
Archer: A Community Distributed Computing Infrastructure for Computer Architecture Research and Education. - Kaibin Huang, Jeffrey G. Andrews, Robert W. Heath Jr., Dongning Guo, Randall A. Berry:
Spatial Interference Cancellation for Multi-Antenna Mobile Ad Hoc Networks. - Benoît Libert, Damien Vergnaud:
Efficient Accountable Authority Identity-Based Encryption under Static Complexity Assumptions. - Chandra Chekuri, Benjamin Moseley:
Online Scheduling to Minimize the Maximum Delay Factor. - Florentin Smarandache:
Extension of Inagaki General Weighted Operators and A New Fusion Rule Class of Proportional Redistribution of Intersection Masses. - Zhi-Hua Zhou, Yu-Yin Sun, Yufeng Li:
Multi-Instance Learning by Treating Instances As Non-I.I.D. Samples. - Martin Hoefer, Alexander Skopalik:
Altruism in Congestion Games. - Hamed Haddadi, Damien Fay, Almerima Jamakovic, Olaf Maennel, Andrew W. Moore, Richard Mortier, Miguel Rio, Steve Uhlig:
Beyond Node Degree: Evaluating AS Topology Models. - Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis:
On Krause's consensus formation model with state-dependent connectivity. - Aikaterini Mitrokotsa, Christos Dimitrakakis, Christos Douligeris:
Intrusion Detection Using Cost-Sensitive Classification. - Mahzad Kalantari, Franck Jung, Jean-Pierre Guédon, Nicolas Paparoditis:
The Five Points Pose Problem : A New and Accurate Solution Adapted to any Geometric Configuration. - Aikaterini Mitrokotsa, Manolis Tsagkaris, Christos Douligeris:
Intrusion Detection in Mobile Ad Hoc Networks Using Classification Algorithms. - Aikaterini Mitrokotsa, Nikos Komninos, Christos Douligeris:
Towards an Effective Intrusion Response Engine Combined with Intrusion Detection in Ad Hoc Networks. - K. B. Nakshatrala, Arun Prakash, K. D. Hjelmstad:
On dual Schur domain decomposition method for linear first-order transient problems. - Robin A. Moser:
Derandomizing the Lovasz Local Lemma more effectively. - Bernd Gärtner:
Ranking Unit Squares with Few Visibilities. - David Eppstein:
Isometric Diamond Subgraphs. - Ozgur Oyman, J. Nicholas Laneman:
Multihop Diversity in Wideband OFDM Systems: The Impact of Spatial Reuse and Frequency Selectivity. - Alexandre Goldsztejn, Claude Michel, Michel Rueher:
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities. - Arfan Ghani, T. Martin McGinnity, Liam P. Maguire, Jim Harkin:
Hardware/Software Co-Design for Spike Based Recognition. - Shizheng Li, Aditya Ramamoorthy:
Rate and power allocation under the pairwise distributed source coding constraint. - Huiguang Liang, Ian Tay, Ming Feng Neo, Wei Tsang Ooi, Mehul Motani:
Avatar Mobility in Networked Virtual Environments: Measurements, Analysis, and Implications. - Tamara Mchedlidze, Antonios Symvonis:
Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings). - Sándor P. Fekete, Christiane Schmidt:
Polygon Exploration with Discrete Vision. - Bruno Martin:
Analyse des suites aléatoires engendrées par des automates cellulaires et applications à la cryptographie. - Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
Revisiting the upper bounding process in a safe Branch and Bound algorithm. - Hélène Collavizza, Michel Rueher, Pascal Van Hentenryck:
CPBVP: A Constraint-Programming Framework for Bounded Program Verification. - Tuvi Etzion, Natalia Silberstein:
Construction of Error-Correcting Codes for Random Network Coding. - Enis Akay, Hong Ju Park, Ender Ayanoglu:
On "Bit-Interleaved Coded Multiple Beamforming". - Marko A. Rodriguez, Vadas Gintautas, Alberto Pepe:
A Grateful Dead Analysis: The Relationship Between Concert and Listening Behavior. - Luca Sanguinetti, Michele Morelli, H. Vincent Poor:
An ESPRIT-based approach for Initial Ranging in OFDMA systems. - Jirí Matousek, Anastasios Sidiropoulos:
Inapproximability for metric embeddings into R^d. - Man-On Pun, D. Richard Brown III, H. Vincent Poor:
Opportunistic Collaborative Beamforming with One-Bit Feedback. - Ashish Goel, Kamesh Munagala:
Hybrid Keyword Search Auctions. - Rafee Ebrahim Kamouna:
Two Fuzzy Logic Programming Paradoxes. - Jérôme Lard, Frédéric Landragin, Olivier Grisvard, David Faure:
Un cadre de conception pour réunir les modèles d'interaction et l'ingénierie des interfaces. - André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz:
Topological Observations on Multiplicative Additive Linear Logic. - Ketan Savla, Emilio Frazzoli:
On Endogenous Reconfiguration in Mobile Robotic Networks. - Deniz Gündüz, Elza Erkip, Andrea J. Goldsmith, H. Vincent Poor:
Transmission of Correlated Sources Over Multi-user Channels. - Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli:
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio. - Philip M. Davis:
Eigenfactor : Does the Principle of Repeated Improvement Result in Better Journal Impact Estimates than Raw Citation Counts? - Yeow Meng Chee, Gennian Ge, Alan C. H. Ling:
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three. - Fei Li:
Online Algorithms for Scheduling Weighted Packets with Deadlines in Bounded Buffers. - Makoto Miwa, Tadashi Wadayama, Ichi Takumi:
A Cutting Plane Method based on Redundant Rows for Improving Fractional Distance. - Raphael Hunger, Michael Joham:
An Asymptotic Analysis of the MIMO BC under Linear Filtering. - Eran Fishler, Sinan Gezici, H. Vincent Poor:
Iterative ('Turbo') Multiuser Detectors For Impulse Radio Systems. - Sinan Gezici, H. Vincent Poor:
Position Estimation via Ultra-Wideband Signals. - Bernardo Sorj:
Information Societies and Digital Divides. - Thomas D. Hewer, Maziar M. Nekovee:
Congestion Reduction Using Ad hoc Message Dissemination in Vehicular Networks. - Olivier Champalle, Bertrand T. David, René Chalon, Guillaume Masserey:
Ordinateur porté support de réalité augmentée pour des activités de maintenance et de dépannage. - Abdulkareem Adinoyi, Yijia Fan, Halim Yanikomeroglu, H. Vincent Poor:
On the Performance of Selection Relaying. - Radha Krishna Ganti, Martin Haenggi:
The Transport Capacity of a Wireless Network is a Subadditive Euclidean Functional. - Guoshen Yu, Jean-Jacques E. Slotine:
Visual Grouping by Neural Oscillators. - Eric Goubault, Sylvie Putot:
Perturbed affine arithmetic for invariant computation in numerical program analysis. - Flavio Rizzolo:
DescribeX: A Framework for Exploring and Querying XML Web Collections. - François Denis, Amaury Habrard, Rémi Gilleron, Marc Tommasi, Édouard Gilbert:
On Probability Distributions for Trees: Representations, Inference and Learning. - Garry Cleere:
Establishing and Measuring Standard Spreadsheet Practices for End-Users. - Bill Bekenn, Ray Hooper:
Reducing Spreadsheet Risk with FormulaDataSleuth. - Enoch Peserico, Luca Pretto:
The rank convergence of HITS can be slow. - Ryan Williams:
Finding paths of length k in O*(2^k) time. - Haipeng Zheng, Sanjeev R. Kulkarni, H. Vincent Poor:
Dimensionally Distributed Learning: Models and Algorithm. - Shrinivas Kudekar, Nicolas Macris:
Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes. - Stefano Buzzi, H. Vincent Poor, Daniela Saturnino:
Energy-Efficient Resource Allocation in Multiuser MIMO Systems: A Game-Theoretic Framework. - Stefano Buzzi, Valeria Massaro, H. Vincent Poor:
Energy-Efficient Power Control in Multipath CDMA Channels via Large System Analysis. - Andrej Muchnik, Alexey V. Chernov, Alexander Shen:
Algorithmic randomness and splitting of supermartingales.