default search action
CoRR, February 2006
- Lane A. Hemaspaandra, Mayur Thakur:
Query-Monotonic Turing Reductions. - Marko A. Rodriguez, Johan Bollen:
Simulating Network Influence Algorithms Using Particle-Swarms: PageRank and PageRank-Priors. - Navneet Mandhani, Subhash C. Kak:
Watermarking Using Decimal Sequences. - Georg Gottlob, Christoph Koch, Klaus U. Schulz:
Conjunctive Queries over Trees. - Francisco Cháves, Marc Daumas:
A library of Taylor models for PVS automatic proof checker. - Christoph Koch:
A Visual Query Language for Complex-Value Databases. - Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam D. Smith:
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. - Julio Mariño, Ángel Herranz-Nieva, Juan José Moreno-Navarro:
Demand Analysis with Partial Predicates. - Endre Csóka:
Efficient design of stochastic mechanisms. - Ming-Yang Kao, Robert T. Schweller:
Reducing Tile Complexity for Self-Assembly Through Temperature Programming. - Giorgi Japaridze:
The intuitionistic fragment of computability logic at the propositional level. - Vladimir Anashin:
Wreath Products in Stream Cipher Design. - David Pritchard:
An Optimal Distributed Edge-Biconnectivity Algorithm. - Amir Laufer, Amir Leshem, Hagit Messer:
Game theoretic aspects of distributed spectral coordination with application to DSL networks. - Ahmad Khoshnevis, Ashutosh Sabharwal:
On the Asymptotic Performance of Multiple Antenna Channels with Fast Channel Feedback. - Christoph Dürr, Mathilde Hurand:
Finding total unimodularity in optimization problems solved by linear programs. - J. S. Espinoza Ortiz, Gilson A. Giraldi, E. A. de Souza Neto, Raúl A. Feijóo:
Quasi-Linear Soft Tissue Models Revisited. - Jiyou Jia, Shufen Hou, Weichao Chen:
Improving the CSIEC Project and Adapting It to the English Teaching and Learning in China. - Nie Nie, Cristina Comaniciu:
Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks. - Yan-Xiu Zheng, Yu T. Su:
Inter-Block Permuted Turbo Codes. - Marc Schoenauer, Michèle Sebag:
Using Domain Knowledge in Evolutionary System Identification. - Alain Ratle, Michèle Sebag:
Avoiding the Bloat with Stochastic Grammar-based Genetic Programming. - Oded Kafri:
Information theory and Thermodynamics. - Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. - Gianluca Argentini:
On local symbolic approximation and resolution of ODEs using Implicit Function Theorem. - Ashiq Anjum, Richard McClatchey, Arshad Ali, Ian Willers:
Bulk Scheduling with DIANA Scheduler. - Krzysztof R. Apt:
Explaining Constraint Programming. - Andrea Montanari, David Tse:
Analysis of Belief Propagation for Non-Linear Problems: The Example of CDMA (or: How to Prove Tanaka's Formula). - John Augustine, David Eppstein, Kevin A. Wortman:
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. - Md. Zafar Ali Khan, B. Sundar Rajan:
Single-Symbol Maximum Likelihood Decodable Linear STBCs. - Wit Jakuczun:
Classifying Signals with Local Classifiers. - David Doty, Jack H. Lutz, Satyadev Nandakumar:
Finite-State Dimension and Real Arithmetic. - Leonid A. Levin:
Self-stabilization of Circular Arrays of Automata. - Yuchun Guo, Changjia Chen, Shi Zhou:
A topology visualisation tool for large-scale communications networks. - Jan Østergaard, Jesper Jensen, Richard Heusdens:
n-Channel Entropy-Constrained Multiple-Description Lattice Vector Quantization. - René Ndoundam, Maurice Tchuenté:
Réseaux d'Automates de Caianiello Revisité. - Joan-Josep Climent, Elisa Gorla, Joachim Rosenthal:
Cryptanalysis of the CFVZ cryptosystem. - Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs. - Andrei Arion, Angela Bonifati, Ioana Manolescu, Andrea Pugliese:
Path Summaries and Path Partitioning in Modern XML Databases. - Samir Chouali, Jacques Julliand, Pierre-Alain Masson, Françoise Bellegarde:
PLTL Partitioned Model Checking for Reactive Systems under Fairness Assumptions. - Radu Mihaescu, Dan Levy, Lior Pachter:
Why neighbor-joining works. - Wojciech Mazurczyk, Zbigniew Kotulski
:
New security and control protocol for VoIP based on steganography and digital watermarking. - Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity. - Siddharth Arora, Jayadev Acharya, Amit Verma, Prasanta K. Panigrahi:
Multilevel Thresholding for Image Segmentation through a Fast Statistical Recursive Algorithm. - Russ Abbott:
Emergence Explained. - Emin Martinian, Martin J. Wainwright:
Analysis of LDGM and compound codes for lossy compression and binning. - Peter Jonsson, Fredrik Kuivinen, Gustav Nordh:
Approximability of Integer Programming with Generalised Constraints. - Kambiz Azarian, Hesham El Gamal, Philip Schniter:
On the Optimality of the ARQ-DDF Protocol. - Arul D. Murugan, Kambiz Azarian, Hesham El Gamal:
Cooperative Lattice Coding and Decoding. - Amir Salman Avestimehr, David N. C. Tse:
Outage Capacity of the Fading Relay Channel in the Low SNR Regime. - Fernando G. Lobo, Cláudio F. Lima:
On the utility of the multimodal problem generator for assessing the performance of Evolutionary Algorithms. - Evgeniy Grigoriev:
The OverRelational Manifesto. - Varsha Dani, Thomas P. Hayes:
How to Beat the Adaptive Multi-Armed Bandit. - Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff. - Fernando G. Lobo, Cláudio F. Lima:
Revisiting Evolutionary Algorithms with On-the-Fly Population Size Adjustment. - Dino Borri, Domenico Camarda:
Building Scenarios for Environmental Management and Planning: An IT-Based Approach. - Melanie J. Agnew, Christopher M. Homan:
Plane Decompositions as Tools for Approximation. - Ruoheng Liu, Predrag Spasojevic, Emina Soljanin:
Incremental Redundancy Cooperative Coding for Wireless Networks: Cooperative Diversity, Coding, and Transmission Energy Gain. - Suchitra Manepalli, Giridhar Manepalli, Michael L. Nelson:
D2D: Digital Archive to MPEG-21 DIDL. - Philip M. Davis, Jason S. Price:
eJournal interface can influence usage statistics: implications for libraries, publishers, and Project COUNTER. - David P. Anderson, Gilles Fedak:
The Computational and Storage Potential of Volunteer Computing. - François Denis, Yann Esposito, Amaury Habrard:
Learning rational stochastic languages. - Tony Thomas, Arbind K. Lal:
Group Signature Schemes Using Braid Groups. - Ana Romero, Julio Rubio, Francis Sergeraert:
Computing spectral sequences. - Rudi Cilibrasi, Paul M. B. Vitányi:
Similarity of Objects and the Meaning of Words. - Louis Mello:
Natural Economics. - Michael B. Baer:
Renyi to Renyi -- Source Coding under Siege. - Kenneth R. Koehler:
Parallel Symbolic Computation of Curvature Invariants in General Relativity. - Vicky Choi:
Faster Algorithms for Constructing a Concept (Galois) Lattice. - Nathan Boeger:
Methods for scaling a large member base. - Alexandros G. Dimakis, Anand D. Sarwate, Martin J. Wainwright:
Geographic Gossip: Efficient Aggregation for Sensor Networks. - Eirik Rosnes, Øyvind Ytrehus:
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets. - Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering. - (Withdrawn) The entropy rate of a binary channel with slowly switching input.
- Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin:
The approximability of MAX CSP with fixed-value constraints. - Ioannis Antonellis, Efstratios Gallopoulos:
Exploring term-document matrices from matrix models in text mining. - Vincent Schmitt, Krzysztof Worytkiewicz:
Bisimulations of enrichments. - John Robert Burger:
Associative Memory For Reversible Programming and Charge Recovery. - Dumitru Mihai Ionescu, Haidong Zhu:
A novel soft information algorithm for closest point search in lattices with Tanner graph representations. - Sheung-Hung Poon, Shripad Thite:
Pants Decomposition of the Punctured Plane. - Xudong Ma, En-Hui Yang:
Low-Density Parity-Check Code with Fast Decoding Speed. - Zaheer Abbas Khan, Mohammed Odeh, Richard McClatchey:
Digital Libraries: From Process Modelling to Grid-based Service Oriented Architecture. - Marco Frailis
A third level trigger programmable on FPGA for the gamma/hadron separation in a Cherenkov telescope using pseudo-Zernike moments and the SVM classifier. - Boris Ryabko, Jaakko Astola:
Universal Codes as a Basis for Time Series Testing. - Michael B. Baer:
Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding. - Ralf Koetter, Pascal O. Vontobel:
On the Block Error Probability of LP Decoding of LDPC Codes. - Pascal O. Vontobel, Ralf Koetter:
Bounds on the Threshold of Linear Programming Decoding. - Pascal O. Vontobel, Ralf Koetter:
Towards Low-Complexity Linear-Programming Decoding. - Roxana Smarandache, Pascal O. Vontobel:
Pseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean Planes. - Li-Sha Huang, Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria. - Young-Han Kim:
Feedback Capacity of Stationary Gaussian Channels. - Martin J. Wainwright:
Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting. - François Denis, Yann Esposito:
Rational stochastic languages. - Altyeb Altaher Altyeb:
Effect of CSMA/CD on Self-Similarity of Network Traffic. - Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Epsilon-Unfolding Orthogonal Polyhedra. - Abhilash Ponnath:
Difficulties in the Implementation of Quantum Computers. - Subhash C. Kak:
The Cubic Public-Key Transformation. - Maarten H. van Emden:
Compositional Semantics for the Procedural Interpretation of Logic. - H. Ibrahim, Maarten H. van Emden:
Towards Applicative Relational Programming. - Daniele Marinazzo, Mario Pellicoro, Sebastiano Stramaglia:
Nonlinear parametric model for Granger causality of time series. - S. D. Makovetskiy:
Numerical Modeling of Coexistence, Competition and Collapse of Rotating Spiral Waves in Three-Level Excitable Media with Discrete Active Centers and Absorbing Boundaries. - Luca Donetti, Pablo I. Hurtado, Miguel A. Muñoz:
Synchronization in Network Structures: Entangled Topology as Optimal Architecture for Network Design. - Frederik Denef, Michael R. Douglas
Computational complexity of the landscape I. - Rafig Agaev, Pavel Chebotarev:
The Matrix of Maximum Out Forests of a Digraph and Its Applications. - Rafig Agaev, Pavel Chebotarev:
Spanning Forests of a Digraph and Their Applications. - Pavel Chebotarev, Elena Shamis:
The Matrix-Forest Theorem and Measuring Relations in Small Social Groups. - Pavel Chebotarev, Elena Shamis:
On Proximity Measures for Graph Vertices. - H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma, Mario Romsy:
What is the Inverse of Repeated Square and Multiply Algorithm? - Pavel Chebotarev, Elena Shamis:
Preference fusion when the number of alternatives exceeds two: indirect scoring procedures. - Ayan Mahalanobis:
The Diffie-Hellman Key Exchange Protocol and non-abelian nilpotent groups. - Jan Poland, Marcus Hutter:
MDL Convergence Speed for Bernoulli Sequences. - Pavel Chebotarev, Elena Shamis:
Characterizations of scoring methods for preference aggregation. - Pavel Chebotarev, Elena Shamis:
From Incomplete Preferences to Ranking via Optimization. - Pavel Chebotarev, Elena Shamis:
The Forest Metric for Graph Vertices. - Pavel Chebotarev, Elena Shamis:
Matrix-Forest Theorems. - Andrea Capocci, Vito Domenico Pietro Servedio, Francesca Colaiori, Luciana S. Buriol, Debora Donato, Stefano Leonardi, Guido Caldarelli:
Preferential attachment in the growth of social networks: the case of Wikipedia. - Mason A. Porter, Peter J. Mucha, M. E. J. Newman, Arthur J. Friend:
Community Structure in the United States House of Representatives. - H. Bombin, M. A. Martin-Delgado:
Topological Quantum Error Correction with Optimal Encoding Rate. - Akinori Kawachi, Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. - R. Srikanth:
The quantum measurement problem and physical reality: a computation theoretic perspective. - Markus Grassl, Martin Rötteler:
Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes. - Giorgio Parisi, Francesco Zamponi:
On the high density behavior of Hamming codes with fixed minimum distance. - Alexander V. Goltsev, Sergey N. Dorogovtsev, J. F. F. Mendes:
k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects. - Shahar Dolev, Itamar Pitowsky, Boaz Tamir:
A quantum secret ballot. - Ewa Graczynska, Dietmar Schweigert:
The dimension of a variety. - Anya Tafliovich, Eric C. R. Hehner:
Quantum Predicative Programming. - Noson S. Yanofsky:
Towards a Definition of an Algorithm.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-14 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: