default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoRR, August 2006
- Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge. - Florentin Smarandache
, Jean Dezert:
An Introduction to the DSm Theory for the Combination of Paradoxical, Uncertain, and Imprecise Sources of Information. - Alessandro Rosa:
On a solution to display non-filled-in quaternionic Julia sets. - José M. Soler:
Separating the articles of authors with the same name. - Kasper Peeters:
A field-theory motivated approach to symbolic computer algebra. - Suhan Choi, S. Sandeep Pradhan:
A Graph-based Framework for Transmission of Correlated Sources over Broadcast Channels. - Thomas Holenstein, Renato Renner:
On the randomness of independent experiments. - Ilya Safro:
The minimum linear arrangement problem on proper interval graphs. - Andrea Cerri, Patrizio Frosini, Claudia Landi:
Stability in multidimensional Size Theory. - Sander Stepanov:
MIMO scheme performance and detection in epsilon noise. - Krzysztof R. Apt:
The Many Faces of Rationalizability. - Roberto Catanuto, Stavros Toumpis, Giacomo Morabito:
Opti{c,m}al: Optical/Optimal Routing in Massively Dense Wireless Networks. - Julien Robert, Nicolas Schabanel:
Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items. - Yuliy M. Baryshnikov, Jian Tan:
Localization for Anchoritic Sensor Networks. - Sebastian Brand, Roland H. C. Yap:
Towards "Propagation = Logic + Control". - Gregory J. Duck, Peter J. Stuckey, Sebastian Brand:
ACD Term Rewriting. - Krzysztof R. Apt, Sebastian Brand:
Infinite Qualitative Simulations by Means of Constraint Programming. - Renato Renner, Stefan Wolf, Jürg Wullschleger:
The single-serving channel capacity. - Sebastian Brand:
Relation Variables in Qualitative Spatial Reasoning. - Jean-Yves Marion, Romain Péchoux:
Quasi-friendly sup-interpretations. - Noga Alon, Eyal Lubetzky:
The Shannon capacity of a graph and the independence numbers of its powers. - Joseph Y. Halpern, Sabina Petride:
Expressing Security Properties Using Selective Interleaving Functions. - Gerhard Wunder, Thomas Michel:
Optimal resource allocation for OFDM multiuser channels. - Shujun Li, Chengqing Li, Kwok-Tung Lo, Guanrong Chen:
Cryptanalysis of an Encryption Scheme Based on Blind Source Separation. - Dinesh Kumar, Eitan Altman, Jean-Marc Kelif:
User-Network Association in a WLAN-UMTS Hybrid Cell: Global & Individual Optimality. - Dinesh Kumar, Dhiman Barman, Eitan Altman, Jean-Marc Kelif:
New Cross-Layer Channel Switching Policy for TCP Transmission on 3G UMTS Downlink. - Edwin A. Henneken, Michael J. Kurtz, Günther Eichhorn, Alberto Accomazzi, Carolyn Stern-Grant, Donna M. Thompson, Elizabeth Bohlen, Stephen S. Murray:
myADS-arXiv - a Tailor-Made, Open Access, Virtual Journal. - Joseph Y. Halpern:
Using Sets of Probability Measures to Represent Uncertainty. - Alexandros G. Dimakis, Martin J. Wainwright:
Guessing Facets: Polytope Structure and Improved LP Decoder. - Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen:
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. - Mikio Fujii:
Secure Positioning of Mobile Terminals with Simplex Radio Communication. - Harald Zankl, Aart Middeldorp:
Satisfying KBO Constraints. - Roberto Bonato:
A Study on Learnability for Rigid Lambek Grammars. - Aashish Sharma, William Yurcik:
Security Assessment of E-Tax Filing Websites. - Naoki Kobayashi, Kohei Suenaga, Lucian Wischik:
Resource Usage Analysis for the Pi-Calculus. - André Hernich, Nicole Schweikardt:
Reversal Complexity Revisited. - (Withdrawn) Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time.
- Joachim Wehler:
Morphisms of Coloured Petri Nets. - Norman Danner, Chris Pollett:
The weak pigeonhole principle for function classes in S^1_2. - Patrick Baillot, Marco Pedicini:
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus. - Igor Sobrado, Dave Uhring:
The Dynamics of A Self-Forming Network. - Gil Wiechman, Igal Sason:
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels. - Babajide Afolabi, Odile Thiery:
Using Users' Expectations to Adapt Business Intelligence Systems. - Jay Kumar Sundararajan, Muriel Médard, Minji Kim, Atilla Eryilmaz, Devavrat Shah, Ralf Koetter:
Network Coding in a Multicast Switch. - Giannis Kouretis, Fotis Georgatos:
LiveWN, cpu scavenging in the Grid Era. - Arshad Ali, Richard McClatchey, Ashiq Anjum, Irfan Habib, Kamran Soomro, Mohammed Asif, Ali Adil, Athar Mohsin:
From Grid Middleware to a Grid Operating System. - Richard McClatchey, David Manset, Tony Solomonides:
Lessons Learned from MammoGrid for Integrated Biomedical Solutions. - Ashiq Anjum, Richard McClatchey, Arshad Ali, Ian Willers:
Bulk Scheduling with the DIANA Scheduler. - Alberto Fernández, Sergio Gómez:
Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms. - Pascal Pons:
Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View. - André Hirschowitz, Marco Maggesi:
Modules over Monads and Linearity. - Alois Schlögl:
GDF - A general dataformat for BIOSIGNALS. - Susan N. Coppersmith:
Renormalization group approach to the P versus NP question. - Luis Rademacher, Santosh S. Vempala:
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. - Hao Chen:
MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves. - (Withdrawn) Wiretap Channel With Side Information.
- Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. - Srinivas Shakkottai, Marina Fomenkov, Dmitri V. Krioukov, Ryan Koga, Kimberly C. Claffy:
Evolution of the Internet AS-Level Ecosystem. - Daniel Hirschkoff, Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-calculus. - Syed Ali Jafar, Krishna Srikanth Gomadam:
Duality and Capacity Region of AF Relay MAC and BC. - Chengpu Wang, Zhen Wang:
Concurrent Processing Memory. - Solomon Feferman:
Tarski's influence on computer science. - Sylvain Pion, Andreas Fabri:
A Generic Lazy Evaluation Scheme for Exact Geometric Computations. - Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solernó:
A linear algebra approach to the differentiation index of generic DAE systems. - L'ubomíra Balková, Edita Pelantová, Ondrej Turek:
Combinatorial and Arithmetical Properties of Infinite Words Associated with Non-simple Quadratic Parry Numbers. - Mariano Zelke:
k-Connectivity in the Semi-Streaming Model. - Tetsushi Matsui:
On Polynomial Time Computable Numbers. - Ke Liu, Nael B. Abu-Ghazaleh:
The Aligned-Coordinated Geographical Routing for Multihop Wireless Networks. - Ke Liu, Nael B. Abu-Ghazaleh, Kyoung-Don Kang:
JiTS: Just-in-Time Scheduling for Real-Time Sensor Data Dissemination. - Haim H. Permuter, Tsachy Weissman, Andrea J. Goldsmith:
Finite State Channels with Time-Invariant Deterministic Feedback. - Avi Steiner, Amichai Sanderovich, Shlomo Shamai:
Broadcast Cooperation Strategies for Two Colocated Users. - Dandan Luo, Yunmin Zhu:
Applications of Random Parameter Matrices Kalman Filtering in Uncertain Observation and Multi-Model Systems. - Leonid B. Litinskii:
Parametrical Neural Networks and Some Other Similar Architectures. - Johannes Köbler, Oleg Verbitsky:
From Invariants to Canonization in Parallel. - Nader Ben Amor, Yannick Le Moullec, Jean-Philippe Diguet, Jean Luc Philippe, Mohamed Abid:
Design of multimedia processor based on metric computation. - Jürg Wullschleger:
Oblivious-Transfer Amplification. - Vinay Kolar, Nael B. Abu-Ghazaleh:
The Effect of Scheduling on Link Capacity in Multi-hopWireless Networks. - A. Slepoy, A. P. Thompson, M. D. Peters:
Searching for Globally Optimal Functional Forms for Inter-Atomic Potentials Using Parallel Tempering and Genetic Programming. - Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin:
Algorithmic linear dimension reduction in the l_1 norm for sparse vectors. - Hao Chen, Jianhua Li:
Lower Bounds on the Algebraic Immunity of Boolean Functions. - Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
How Hard Is Bribery in Elections? - S. M. Nazrul Alam, Peter Marbach:
Competition and Request Routing Policies in Content Delivery Networks. - Paul M. Aoki, Margaret H. Szymanski, Luke D. Plurkowski, James D. Thornton, Allison Woodruff, Weilie Yi:
Where's the "Party" in "Multi-Party"? Analyzing the Structure of Small-Group Sociable Talk. - Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. - (Withdrawn) A Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision Branching Programs.
- Nandakishore Santhi, Alexander Vardy:
Analog Codes on Graphs. - Nandakishore Santhi, Alexander Vardy:
On an Improvement over Rényi's Equivocation Bound. - Petter Holme, Josh Karlin, Stephanie Forrest:
Radial Structure of the Internet. - Shuchin Aeron, Venkatesh Saligrama:
Wireless ad-hoc networks: Strategies and Scaling laws for the fixed SNR regime. - Gun Srijuntongsiri, Stephen A. Vavasis:
A Condition Number Analysis of a Line-Surface Intersection Algorithm. - Floris Geerts, Peter Z. Revesz, Jan Van den Bussche:
On-line topological simplification of weighted graphs. - Ariel Daliot, Danny Dolev:
Self-Stabilizing Byzantine Pulse Synchronization. - Alexander V. Evako:
Connection between continuous and digital n-manifolds and the Poincare conjecture. - Hector Zenil:
On Universality in Real Computation. - Markus Mueller:
Stationary Algorithmic Probability. - Ariel Daliot, Danny Dolev, Hanna Parnas:
Linear-time Self-stabilizing Byzantine Clock Synchronization. - Angelo B. Mingarelli:
A study of fuzzy and many-valued logics in cellular automata. - Arvind Parthasarathy:
Improved Content Based Image Watermarking. - Tomi Janhunen, Emilia Oikarinen:
Automated verification of weak equivalence within the SMODELS system. - Peter D. Turney:
Similarity of Semantic Relations. - Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. - Jochen Mundinger, Jean-Yves Le Boudec:
Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars. - Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Logic programs with monotone abstract constraint atoms. - Uday P. Khedker, Amitabha Sanyal, Amey Karkare:
Heap Reference Analysis Using Access Graphs. - Hui Guo, Ying Jiang:
Application Layer Definition and Analyses of Controller Area Network Bus for Wire Harness Assembly Machine. - Philippe Moser:
Lp Computable Functions and Fourier Series. - Fionn Murtagh:
The Haar Wavelet Transform of a Dendrogram. - Nicolas Brodu:
Spherical Indexing for Neighborhood Queries. - Michael Hohensee:
Realistic Boundary Conditions for Ad Hoc Network Node Mobility Models and a New Approach to the Random Waypoint Model. - Robert Colvin, Ian J. Hayes, Paul A. Strooper:
Calculating modules in contextual logic program refinement. - Ali Mesbah, Arie van Deursen:
An Architectural Style for Ajax. - Benoit Hudzia, Liam McDermott, Tariq N. Ellahi, M. Tahar Kechadi:
Entity Based Peer-to-Peer in a Data Grid Environment. - Benoit Hudzia, Tariq N. Ellahi, Liam McDermott, M. Tahar Kechadi:
A Java Based Architecture of P2P-Grid Middleware. - Benoit Hudzia, Serge G. Petiton:
Reliable multicast fault tolerant MPI in the Grid environment. - Leonid B. Litinskii, Dmitry E. Romanov:
Neural Network Clustering Based on Distances Between Objects. - Tariq N. Ellahi, Benoit Hudzia, Liam McDermott, M. Tahar Kechadi:
Transparent Migration of Multi-Threaded Applications on a Java Based Grid. - Chih-Chun Wang:
Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC Code Ensemble. - Benoit Hudzia, M. Tahar Kechadi, Adrian Ottewill:
TreeP: A Tree-Based P2P Network Architecture. - Shiguo Lian, Jinsheng Sun, Zhiquan Wang:
Security Analysis of A Chaos-based Image Encryption Algorithm. - Thierry Cachat:
Controller synthesis & Ordinal Automata. - Cheng-Yuan Liou, Bruce R. Musicus:
Cross Entropy Approximation of Structured Covariance Matrices. - A. Mani:
OSS-Based Grid Computing. - (Withdrawn) Proof of a Conjecture of Helleseth Regarding Pairs of Binary m-Sequences.
- Philip Bille, Inge Li Gørtz:
The Tree Inclusion Problem: In Linear Space and Faster. - Frédéric Blanqui:
Decidability of Type-checking in the Calculus of Algebraic Constructions with Size Annotations. - Tommaso Rizzo, Bastian Wemmenhove, Hilbert J. Kappen:
On Cavity Approximations for Graphical Models. - Mensur Omerbashich:
Gauss-Vanicek Spectral Analysis of the Sepkoski Compendium: No New Life Cycles. - Frédéric Dambreville:
Conflict Free Rule for Combining Evidences. - Henrik Bäärnhielm:
Recognising the Suzuki groups in their natural representations. - Matthias Hein, Jean-Yves Audibert, Ulrike von Luxburg:
Graph Laplacians and their convergence on random neighborhood graphs. - XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
On optimal quantization rules for some sequential decision problems. - Reinhard Muskens:
Intensional Models for the Theory of Types. - Gilles Blanchard, François Fleuret:
Occam's hammer: a link between randomized learning and multiple testing FDR control. - Peter Bubenik:
Context for models of concurrency. - Chengqing Li, Shujun Li, Gonzalo Álvarez, Guanrong Chen, Kwok-Tung Lo:
Cryptanalysis of a chaotic block cipher with external key and its improved version. - Paulo Laureti, L. Moret, Yi-Cheng Zhang, Y.-K. Yu:
Information filtering via Iterative Refinement. - Ariel Caticha, Adom Giffin:
Updating Probabilities. - Branko J. Malesevic:
One method for proving inequalities by computer. - L'ubomíra Balková, Edita Pelantová, Wolfgang Steiner:
Sequences with constant number of return words. - Malgorzata Snarska, Jakub Krzych:
Automatic Trading Agent. RMT based Portfolio Theory and Portfolio Selection. - Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via Quantum Walk.
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 2025-02-21 19:36 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:
