default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoRR, July 2006
- Chinmoy Bhattacharya, P. R. Mahapatra:
A Novel Application of Lifting Scheme for Multiresolution Correlation of Complex Radar Signals. - Igal Sason, Idan Goldenberg:
Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations. - Moshe Twitto, Igal Sason, Shlomo Shamai:
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes. - Moshe Twitto, Igal Sason:
On the Error Exponents of Some Improved Tangential-Sphere Bounds. - Florentin Smarandache, Jean Dezert:
Belief Conditioning Rules (BCRs). - Mariano Ceccato, Marius Marin, Kim Mens, Leon Moonen, Paolo Tonella, Tom Tourwé:
Applying and Combining Three Different Aspect Mining Techniques. - Boris D. Lubachevsky:
Theory of sexes by Geodakian as it is advanced by Iskrin. - Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski:
3-facial colouring of plane graphs. - Yuri Pritykin:
Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues. - Samuel Sattath:
ITs, a structure sensitive information theory. - Ayan Mahalanobis:
A simple generalization of El-Gamal cryptosystem to non-abelian groups. - Anne-Marie Vercoustre, Mounir Fegas, Saba Gul, Yves Lechevallier:
A Flexible Structured-based Representation for XML Document Mining. - Jan Chomicki:
Database Querying under Changing Preferences. - Aaron B. Wagner, Pramod Viswanath, Sanjeev R. Kulkarni:
Strong Consistency of the Good-Turing Estimator. - Juan C. Valle-Lisboa, Eduardo Mizraji:
The uncovering of hidden structures by Latent Semantic Analysis. - Krzysztof R. Apt, Peter Zoeteweij:
An Analysis of Arithmetic Constraints on Integer Intervals. - Fabrice Portier, Jean-Yves Baudais, Jean-François Hélard:
Performance of STBC MC-CDMA systems over outdoor realistic MIMO channels. - Edward Hanna:
Feynman Checkerboard as a Model of Discrete Space-Time. - Stephen P. Luttrell:
Modelling the Probability Density of Markov Sources. - Chun-Hao Hsu, Achilleas Anastasopoulos:
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels. - Jun Chen, Dake He, Ashish Jagmohan:
Slepian-Wolf Code Design via Source-Channel Correspondence. - George A. Maney:
Ten Incredibly Dangerous Software Ideas. - Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez:
Sharp threshold for hamiltonicity of random geometric graphs. - Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators. - Oskar Sandberg, Ian Clarke:
The evolution of navigable small-world networks. - James Aspnes, Yang Richard Yang, Yitong Yin:
Path-independent load balancing with unreliable machines. - Junli Hu, Hans-Andrea Loeliger, Justin Dauwels, Frank R. Kschischang:
A general computation rule for lossy summaries/messages with examples from equalization. - Christian Lavault, Jean-François Marckert, Vlady Ravelomanana:
A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots. - (Withdrawn) An unlikely result.
- Michael Vielhaber, Mónica del Pilar Canales Chacon:
Towards a General Theory of Simultaneous Diophantine Approximation of Formal Power Series: Multidimensional Linear Complexity. - Christian Lavault, Mario Valencia-Pabon:
A distributed approximation algorithm for the minimum degree minimum weight spanning trees. - Christian Lavault, Guy Louchard:
Asymptotic Analysis of a Leader Election Algorithm. - Oleg Verbitsky:
Planar Graphs: Logical Complexity and Parallel Isomorphism Tests. - Christian Lavault, Jean-François Marckert, Vlady Ravelomanana:
Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots. - Yi Deng, Dongdai Lin:
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption. - Roland Hildebrand, Stefano Mancini, Simone Severini:
Combinatorial laplacians and positivity under partial transpose. - Zhujun Fan:
The Minimal Cost Algorithm for Off-Line Diagnosability of Discrete Event Systems. - Benoit Donnet, Bruno Baynat, Timur Friedman
:
Retouched Bloom Filters: Allowing Networked Applications to Flexibly Trade Off False Positives Against False Negatives. - Maarten H. van Emden:
Set-Theoretic Preliminaries for Computer Scientists. - Enrico Pontelli, Karen Villaverde, Hai-Feng Guo, Gopal Gupta:
PALS: Efficient Or-Parallelism on Beowulf Clusters. - Christophe Cérin, Jean-Christophe Dubacq, Jean-Louis Roch:
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters. - Rahul Jain:
Towards a classical proof of exponential lower bound for 2-probe smooth codes. - Koujin Takeda, Shinsuke Uda, Yoshiyuki Kabashima:
Analysis of CDMA systems that are characterized by eigenvalue spectrum. - Audris Kalnins, Valdis Vitolins:
Use of UML and Model Transformations for Workflow Process Definitions. - Xin Han, Deshi Ye, Yong Zhou:
Improved online hypercube packing. - Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang:
Strip Packing vs. Bin Packing. - Nick Palmer, Paul W. Goldberg:
PAC Classification based on PAC Estimates of Label Class Distributions. - Emmanuel Viennet, Françoise Fogelman-Soulié, Benoit Rognier:
Evaluation de Techniques de Traitement des Refusés pour l'Octroi de Crédit. - Pierre Parrend, Stéphane Frénot:
Secure Component Deployment in the OSGi(tm) Release 4 Platform. - Pascal Barla, Simon Breslav, Lee Markosian, Joëlle Thollot:
Interactive Hatching and Stippling by Example. - Catherine Recanati:
Raisonner avec des diagrammes : perspectives cognitives et computationnelles. - Thierry Poibeau:
Dealing with Metonymic Readings of Named Entities. - Thierry Poibeau:
Linguistically Grounded Models of Language Change. - Elliott H. Lieb, Daniel N. Osherson, Scott Weinstein:
Elementary Proof of a Theorem of Jean Ville. - Hisayuki Hara, Akimichi Takemura:
Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph. - Sylviane R. Schwer:
Reasoning with Intervals on Granules. - Vlady Ravelomanana:
The Average Size of Giant Components Between the Double-Jump. - Tom Ridge:
Craig's Interpolation Theorem formalised and mechanised in Isabelle/HOL. - Vlady Ravelomanana, Alphonse Laza Rijamamy:
Creation and Growth of Components in a Random Hypergraph Process. - Yoann Dieudonné, Ouiddad Labbani-Igbida, Franck Petit:
Circle Formation of Weak Mobile Robots. - Igor Mackarov:
On Some Peculiarities of Dynamic Switch between Component Implementations in an Autonomic Computing System. - Matt Thomas, Bo Pang, Lillian Lee:
Get out the vote: Determining support or opposition from Congressional floor-debate transcripts. - Cathal Boogerd, Leon Moonen:
Prioritizing Software Inspection Results using Static Profiling. - Abdelaziz Amraoui, Andrea Montanari, Rüdiger L. Urbanke:
How to Find Good Finite-Length Codes: From Art Towards Science. - Khalil Djelloul:
Decomposable Theories. - Antonis Sidiropoulos, Dimitrios Katsaros, Yannis Manolopoulos:
Generalized h-index for Disclosing Latent Facts in Citation Networks. - Vladimir Vovk:
Competing with stationary prediction strategies. - Felice Manganiello:
Computation of the Weight Distribution of CRC Codes. - Mahesh C. Shastry, Nithin Nagaraj, Prabhakar G. Vaidya:
The B-Exponential Map: A Generalization of the Logistic Map, and Its Applications In Generating Pseudo-random Numbers. - Victor V. Kryssanov, Frank J. Rinaldo, Hitoshi Ogawa, Evgeny L. Kuleshov:
Citation as a Representation Process. - Hai Fang, Y. Kilani, Jimmy Ho-Man Lee, Peter J. Stuckey:
Islands for SAT. - Scott A. Turner, Manuel A. Pérez-Quiñones, Stephen H. Edwards:
Effect of Interface Style in Peer Review Comments for UML Designs. - Andrea Montanari, Devavrat Shah:
Counting good truth assignments of random k-SAT formulae. - Xiao-Hong Peng, Paddy G. Farrell:
On Construction of the (24,12,8) Golay Codes. - Chandra Nair, Balaji Prabhakar, Devavrat Shah:
On entropy for mixtures of discrete and continuous variables. - Oliver Kosut, Lang Tong:
Capacity of Cooperative Fusion in the Presence of Byzantine Sensors. - Emin Gabrielyan:
Fault-Tolerant Real-Time Streaming with FEC thanks to Capillary Multi-Path Routing. - Ying Hung Gan, Cong Ling, Wai Ho Mow:
Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection. - Dima Ruinskiy, Adi Shamir, Boaz Tsaban:
Length-based cryptanalysis: The case of Thompson's Group. - Shai Carmi, Shlomo Havlin, Scott Kirkpatrick, Yuval Shavitt, Eran Shir:
New Model of Internet Topology Using k-shell Decomposition. - Marie-France Ango-Obiang:
Système de représentation d'aide au besoin dans le domaine architectural. - Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well quasi-orders and the shuffle closure of finite sets. - Stanko Vl. Shtrakov, Anton Stoilov:
Mathematical Modelling of the Thermal Accumulation in Hot Water Solar Systems. - Daniel Kayser, Farid Nouioua:
About Norms and Causes. - Amaury Habrard, François Denis, Yann Esposito:
Using Pseudo-Stochastic Rational Languages in Probabilistic Grammatical Inference. - Daniel Kayser, Farid Nouioua:
Representing Knowledge about Norms. - Emmanuel Ramasso, Michèle Rombaut, Denis Pellerin:
Un filtre temporel crédibiliste pour la reconnaissance d'actions humaines dans les vidéos. - Farid Nouioua, Pascal Nicolas:
Using Answer Set Programming in an Inference-Based approach to Natural Language Semantics. - Ryan Hutchinson, Roxana Smarandache, Jochen Trumpf:
Superregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile. - Adityan Rishiyur:
Neural Networks with Complex and Quaternion Inputs. - Stanko Vl. Shtrakov, Anton Stoilov:
Finite element method for thermal analysis of concentrating solar receivers. - L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Representing graphs as the intersection of axis-parallel cubes. - Craig Alan Feinstein:
A New and Elegant Argument that P is not NP. - David Eppstein:
Upright-Quad Drawing of st-Planar Learning Spaces. - Hyundong Shin, Moe Z. Win:
Gallager's Exponent for MIMO Channels: A Reliability-Rate Tradeoff. - Dominique Bouthinon, Henry Soldano, Véronique Ventos:
Logical settings for concept learning from incomplete examples in First Order Logic. - Tahiry Razafindralambo, Isabelle Guérin Lassous, Luigi Iannone, Serge Fdida:
Dynamic Packet Aggregation to Solve Performance Anomaly in 802.11 Wireless Networks. - A. Robert Calderbank, Anna C. Gilbert, Martin J. Strauss:
List decoding of noisy Reed-Muller-like codes. - Syed Ali Jafar, Shlomo Shamai:
Degrees of Freedom Region for the MIMO X Channel. - Xin Han, Kazuo Iwama, Guochuan Zhang:
New Upper Bounds on The Approximability of 3D Strip Packing. - Patricia M. Hill, Fausto Spoto:
Deriving Escape Analysis by Abstract Interpretation: Proofs of results. - Shivaprasad Kotagiri, J. Nicholas Laneman:
Multiple Access Channels with State Information Known at Some Encoders. - Lester Ingber:
Ideas by Statistical Mechanics (ISM). - Hao Chen:
Reducing the Computation of Linear Complexities of Periodic Sequences over GF(pm). - Daniel A. Spielman, Shang-Hua Teng:
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. - Hubie Chen:
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. - Louis Mello:
Linear Predictive Coding as an Estimator of Volatility. - Ernst M. Gabidulin, Pierre Loidreau:
Properties of subspace subcodes of optimum codes in rank metric. - Marko Samer, Stefan Szeider:
Complexity and Applications of Edge-Induced Vertex-Cuts. - Etienne Grossmann:
A Theory of Probabilistic Boosting, Decision Trees and Matryoshki. - William Yurcik, Cristina L. Abad, Ragib Hasan, Moazzam Saleem, Shyama Sridharan:
UCLog+ : A Security Data Management System for Correlating Alerts, Incidents, and Raw Data From Remote Logs. - Mikhail G. Stepanov, Michael Chertkov:
Improving convergence of Belief Propagation decoding. - Josiah Carlson, David Eppstein:
Trees with Convex Faces and Optimal Angles. - Martin Ziegler:
Revising Type-2 Computation and Degrees of Discontinuity. - Marcin Kaminski, Vadim V. Lozin:
Polynomial-time algorithm for vertex k-colorability of P_5-free graphs. - Rui Abreu, Peter Zoeteweij, Arjan J. C. van Gemund:
Program Spectra Analysis in Embedded Software: A Case Study. - Gagan Aggarwal, S. Muthukrishnan, Jon Feldman:
Bidding to the Top: VCG and Equilibria of Position-Based Auctions. - Toshiyasu Arai, Naohi Eguchi:
A new function algebra of EXPTIME functions by safe nested recursion. - Sergey V. Zykov:
Web-Based Enterprise Information Systems Development: The Integrated Methodology. - Peter D. Turney:
Expressing Implicit Semantic Relations without Supervision. - Sergey V. Zykov, Gleb G. Pogodayev:
Object-Based Groupware: Theory, Design and Implementation Issues. - Sergey V. Zykov:
Enterprise Content Management: Theory and Engineering for Entire Lifecycle Support. - Sergey V. Zykov:
Enterprise Portal Development Tools: Problem-Oriented Approach. - Sergey V. Zykov:
ConceptModeller: a Problem-Oriented Visual SDK for Globally Distributed Enterprise Systems. - Sergey V. Zykov:
Enterprise Portal: from Model to Implementation. - Sergey V. Zykov:
Abstract Machine as a Model of Content Management Information System. - Sergey V. Zykov:
Integrating Enterprise Software Applications with Web Portal Technology. - Sergey V. Zykov:
The Integrated Approach to ERP: Embracing the Web. - Sergey V. Zykov:
Enterprise Resource Planning Systems: the Integrated Approach. - Sergey V. Zykov:
Towards Implementing an Enterprise Groupware-Integrated Human Resources Information System. - Boris Skoric, T. U. Vladimirova, Mehmet Utku Celik, Joop Talstra:
Tardos fingerprinting is better than we thought. - Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian, Ludo M. G. M. Tolhuizen:
On q-ary codes correcting all unidirectional errors of a limited magnitude. - Robert Ewaschuk, Peter D. Turney:
Self-Replication and Self-Assembly for Manufacturing. - Vladimir Vovk:
Leading strategies in competitive on-line prediction. - Shmuel Friedland, Daniel Levy:
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs. - Vladimir Vovk:
Competing with Markov prediction strategies. - Henrik Petander, Eranga Perera, Aruna Seneviratne:
Multicasting with selective delivery: A SafetyNet for vertical handoffs. - Mohamed Belal:
A Foundation to Perception Computing, Logic and Automata. - Thomas Holenstein:
Parallel repetition: simplifications and the no-signaling case. - Lukas Pichl, Taisei Kaizoji, Takuya Yamano:
Stylized Facts in Internal Rates of Return on Stock Index and its Derivative Transactions. - Karl Crary, Robert Harper:
Logic Column 16: Higher-Order Abstract Syntax: Setting the Record Straight. - Nicolai Kuntze, Dominique Maehler, Andreas U. Schmidt:
Employing Trusted Computing for the forward pricing of pseudonyms in reputation systems. - Jean Dezert, Albena Tchamova, Florentin Smarandache, Pavlina D. Konstantinova:
Target Type Tracking with PCR5 and Dempster's rules: A Comparative Analysis. - Stanimir Andonov:
Levels of Product Differentiation in the Global Mobile Phones Market. - Yannis Bakopoulos, Theophanis Raptis, Doxaras Ioannis:
Geometric definition of a new skeletonization concept. - Joseph Y. Halpern, Riccardo Pucella:
Modeling Adversaries in a Logic for Security Protocol Analysis. - Florentin Smarandache, Jean Dezert:
Fusion of qualitative beliefs using DSmT. - Mohsen Bayati, Chandra Nair:
A rigorous proof of the cavity method for counting matchings. - R. C. Venkatesan:
Encryption of Covert Information into Multiple Statistical Distributions. - Naoto Morikawa:
Discrete differential geometry of triangle tiles and algebra of closed trajectories. - Xueliang Li, Jianhua Tu:
NP-completeness of 4-incidence colorability of semi-cubic graphs. - Isabelle Abraham, Romain Abraham, Maïtine Bergounioux:
An active curve approach for tomographic reconstruction of binary radially symmetric objects. - Bernd Sturmfels, Jenia Tevelev, Josephine Yu:
The Newton Polytope of the Implicit Equation. - Gérard Duchamp, Éric Laugerotte, Jean-Gabriel Luque:
Extending the scalars of minimizations. - Gérard Duchamp, Marianne Flouret, Éric Laugerotte, Jean-Gabriel Luque:
Direct and dual laws for automata with multiplicities. - Jean-Gabriel Luque, Gérard Henry Edmond Duchamp:
Transitive factorizations of free partially commutative monoids and Lie algebras. - Nicolas Tabareau:
De l'oprateur de trace dans les jeux de Conway. - Mathieu Coquerelle, Jérémie Allard, Georges-Henri Cottet, Marie-Paule Cani:
A Vortex Method for Bi-phasic Fluids Interacting with Rigid Bodies. - Lek-Heng Lim:
Singular Values and Eigenvalues of Tensors: A Variational Approach. - Alexandre Moreau-Gaudry, Fabien Robineau, Pierre-Frédéric André, Anne Prince, Pierre Pauget, Jacques Demongeot, Yohan Payan:
Utilisation de la substitution sensorielle par électro-stimulation linguale pour la prévention des escarres chez les paraplégiques. Etude préliminaire. - Branko Dragovich, Alexandra Dragovich:
A p-Adic Model of DNA Sequence and Genetic Code. - P. G. L. Porta Mana, Anders Månsson, Gunnar Björk:
'Plausibilities of plausibilities': an approach through circumstances. - Iordanis Kerenidis, Ran Raz:
The one-way communication complexity of the Boolean Hidden Matching Problem. - Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. - Nelly Litvak, Werner R. W. Scheinhardt, Yana Volkovich:
In-Degree and PageRank of Web pages: Why do they follow similar power laws? - Bogdan Danila, Yong Yu, John A. Marsh, Kevin E. Bassler:
Optimal routing on complex networks. - Adam N. Letchford, Dirk Oliver Theis:
Odd minimum cut sets and b-matchings revisited.
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-10-26 23: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:
