default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoRR, December 2005
- Jeremy Carroll, Frank Ruskey, Mark Weston:
Which n-Venn diagrams can be drawn with convex k-gons? - Vitorino Ramos, Carlos M. Fernandes, Agostinho C. Rosa:
On Self-Regulated Swarms, Societal Memory, Speed and Dynamics. - Vitorino Ramos, Carlos M. Fernandes, Agostinho C. Rosa:
Societal Implicit Memory and his Speed on Tracking Extrema over Dynamic Environments using Self-Regulatory Swarms. - Carlos M. Fernandes, Vitorino Ramos, Agostinho C. Rosa:
Self-Regulated Artificial Ant Colonies on Digital Image Habitats. - Vitorino Ramos, Carlos M. Fernandes, Agostinho C. Rosa:
On Ants, Bacteria and Dynamic Environments. - Henry D. Pfister, Igal Sason:
Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity. - Arindam Mitra:
Entangled messages. - Joel Friedman:
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity. - Bas Spitters:
Almost periodic functions, constructively. - Jonathan Gratus, Timothy Porter:
A geometry of information, I: Nerves, posets and differential forms. - Shi Zhou:
Understanding the internet topology evolution dynamics. - Brijesh Dongol, Doug Goldson:
Extending the theory of Owicki and Gries with a logic of progress. - Lifeng Lai, Hesham El Gamal:
The Water-Filling Game in Fading Multiple Access Channels. - Farhad Meshkati, Mung Chiang, H. Vincent Poor, Stuart C. Schwartz:
A Game-Theoretic Approach to Energy-Efficient Power Control in Multi-Carrier CDMA Systems. - Maxim Raginsky:
Joint fixed-rate universal lossy coding and identification of continuous-alphabet memoryless sources. - Miklós Csürös:
A linear-time algorithm for finding the longest segment which scores above a given threshold. - Saurabha Tavildar, Pramod Viswanath:
Approximately Universal Codes over Slow Fading Channels. - Anthony Mouraud, Didier Puzenat, Hélène Paugam-Moisy:
DAMNED: A Distributed and Multithreaded Neural Event-Driven simulation framework. - Marek W. Gutowski:
Amazing geometry of genetic space or are genetic algorithms convergent? - Nima Sarshar, Xiaolin Wu:
A Practical Approach to Joint Network-Source Coding. - Brahim Hamid, Ted Herman, Morten Mjelde:
The Poster Session of SSS 2005. - Louis Mello:
Fat Tailed Distributions in Catastrophe Prediction. - Petros Elia, B. A. Sethuraman, P. Vijay Kumar:
Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas. - Alexander Barg, Dmitry Yu. Nogin:
A bound on Grassmannian codes. - Alexander Barg, Dmitry Yu. Nogin:
Spectral approach to linear programming bounds on codes. - I. Josopait:
Checking C++ Programs for Dimensional Consistency. - Jing Chen:
The Physical Foundation of Human Mind and a New Theory of Investment. - Petros Elia, P. Vijay Kumar:
Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks. - Elitza N. Maneva, Amin Shokrollahi:
New model for rigorous analysis of LT-codes. - Ram Somaraju, Leif Hanlen:
Uncertainty Principles for Signal Concentrations. - Slawomir Lasota, Igor Walukiewicz:
Alternating Timed Automata. - Sebastián Bengochea, Angel Talamona, Michel Parent:
A Software Framework for Vehicle-Infrastructure Cooperative Applications. - Bernardo A. Huberman, Fang Wu:
Bootstrapping the Long Tail in Peer to Peer Systems. - Bernardo A. Huberman, Fang Wu, Li Zhang:
Ensuring Trust in One Time Exchanges: Solving the QoS Problem. - Sergey P. Tarasov, Mikhail N. Vyalyi:
Semidefinite programming and arithmetic circuit evaluation. - Alwen Tiu:
A System of Interaction and Structure II: The Need for Deep Inference. - Aristoklis D. Anastasiadis, George D. Magoulas:
Evolving Stochastic Learning Algorithm Based on Tsallis Entropic Index. - Aris L. Moustakas, Steven H. Simon, Thomas L. Marzetta:
Capacity of Differential versus Non-Differential Unitary Space-Time Modulation for MIMO channels. - Jianqin Zhou, Xirong Xu:
An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q). - Jianqin Zhou:
A fast algorithm for determining the linear complexity of periodic sequences. - Jianqin Zhou:
Generalized partially bent functions. - Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo:
Points on Computable Curves. - Dirk Wagner, John Noga:
Random Walks with Anti-Correlated Steps. - Joshua Stinehour, Stanislaw P. Radziszowski, Kung-Kuen Tse:
Computation of the Ramsey Number R(W5,K5). - Xuan-Ha Vu, Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings:
Branch-and-Prune Search Strategies for Numerical Constraint Solving. - George B. Mertzios:
The k-Cluster Over the Interval Graphs Lies in P. - Jose L. Salmeron, Florentin Smarandache
:
Processing Uncertainty and Indeterminacy in Information Systems success mapping. - Tharaka A. Lamahewa, Rodney A. Kennedy, Thushara D. Abhayapala, Van K. Nguyen:
Spatial Precoder Design for Space-Time Coded MIMO Systems: Based on Fixed Parameters of MIMO Channels. - Jeff Stuckman, Guo-Qiang Zhang:
Mastermind is NP-Complete. - Jérôme Azé, Mathieu Roche, Yves Kodratoff, Michèle Sebag:
Preference Learning in Terminology Extraction: A ROC-based approach. - Gwénaël Richomme, Francis Wlazinski:
Existence of finite test-sets for k-power-freeness of uniform morphisms. - Ion I. Mandoiu, Claudia Prajescu:
High-Throughput SNP Genotyping by SBE/SBH. - John M. Hitchcock:
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets. - Gennady P. Berman, Vyacheslav N. Gorshkov, Xidi Wang:
Irreducible Frequent Patterns in Transactional Databases. - Yi-Dong Shen, Danny De Schreye:
Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach. - Roberto Bagnara, Andrea Pescetti, Alessandro Zaccagnini, Enea Zaffanella:
PURRS: Towards Computer Algebra Support for Fully Automatic Worst-Case Complexity Analysis. - Roberto M. Amadio, Silvano Dal-Zilio:
Resource Control for Synchronous Cooperative Threads. - Roberto M. Amadio, Gérard Boudol, Ilaria Castellani, Frédéric Boussinot:
Reactive concurrent programming revisited. - Vladimir Vovk:
Competing with wild prediction rules. - Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
Distributed Navigation Algorithms for Sensor Networks. - Philip Bille, Inge Li Gørtz:
Matching Subsequences in Trees. - Jürgen Schmidhuber, Matteo Gagliolo, Daan Wierstra, Faustino J. Gomez:
Evolino for recurrent support vector machines. - Jan Eriksson, Visa Koivunen:
Complex Random Vectors and ICA Models: Identifiability, Uniqueness and Separability. - Martin Kutz:
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. - Todd L. Veldhuizen:
Tradeoffs in Metaprogramming. - Vishwambhar Rathi:
On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles. - Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Solving Partial Order Constraints for LPO Termination. - Daniel S. Swaney, Frank McCown, Michael L. Nelson:
Dynamic Web File Format Transformations with Grace. - Frank McCown, Joan A. Smith, Michael L. Nelson, Johan Bollen:
Reconstructing Websites for the Lazy Webmaster. - Bertrand Nouvel, Eric Rémila:
Incremental and Transitive Discrete Rotations. - Jon Timmis, Martyn Amos, Wolfgang Banzhaf, Andy M. Tyrrell:
"Going back to our roots": second generation biocomputing. - Ioannis Z. Emiris, Elias P. Tsigaridas:
Computations with one and two real algebraic numbers. - Vladimir V. Kisil:
Fillmore--Springer--Cnops Construction Implemented in GiNaC. - Igal Sason, Shlomo Shamai:
Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview. - Igal Sason, Gil Wiechman:
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach. - Igal Sason, Gil Wiechman:
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications. - Gene Itkis, Leonid A. Levin:
Flat Holonomies on Automata Networks. - Pascal O. Vontobel, Ralf Koetter:
Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes. - Eirik Fossgård:
An invariant bayesian model selection principle for gaussian data in a sparse representation. - Grigorii Pivovarov, Sergei Trunov:
EqRank: Theme Evolution in Citation Graphs. - Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu:
De Dictionariis Dynamicis Pauco Spatio Utentibus. - Héctor Ruíz Barradas, Didier Bert:
A Fixpoint Semantics of Event Systems with and without Fairness Assumptions. - Jiangtao Meng:
New directions in mechanism design. - Nikita A. Sakhanenko, Hanna E. Makaruk:
Understanding physics from interconnected data. - Todd Holloway, Miran Bozicevic, Katy Börner:
Analyzing and Visualizing the Semantic Coverage of Wikipedia and Its Authors. - Lutz Straßburger:
On the Axiomatisation of Boolean Categories with and without Medial. - Ashish Khisti, Uri Erez, Gregory W. Wornell:
Fundamental Limits and Scaling Behavior of Cooperative Multicasting in Wireless Networks. - Nelson Antunes, Christine Fricker, Philippe Robert, Danielle Tibi:
Analysis of loss networks with routing. - Stephen F. Bush, Todd Hughes:
On The Effectiveness of Kolmogorov Complexity Estimation to Discriminate Semantic Types. - Renaud Lambiotte, Marcel Ausloos:
Collaborative tagging as a tripartite network. - Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. - Stephen F. Bush, Nathan Smith:
The Limits of Motion Prediction Support for Ad hoc Wireless Network Performance. - Arya Mazumdar, Ajit Kumar Chaturvedi, Adrish Banerjee:
Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs. - Stephen F. Bush:
Low-Energy Sensor Network Time Synchronization as an Emergent Property. - Priya Mahadevan, Dmitri V. Krioukov, Marina Fomenkov, Bradley Huffaker, Xenofontas A. Dimitropoulos, Kimberly C. Claffy, Amin Vahdat:
The Internet AS-Level Topology: Three Data Sources and One Definitive Metric. - Ralf Lämmel:
Book review "The Haskell Road to Logic, Maths and Programming". - Jialing Liu, Nicola Elia:
Gaussian Channels with Feedback: Optimality, Fundamental Limitations, and Connections of Communication, Estimation, and Control. - Dmitry P. Paukov:
Mathematical models of the complex surfaces in simulation and visualization systems. - Mark Burgin:
Mathematical Models in Schema Theory. - Giorgi Japaridze:
The logic of interactive Turing reduction. - K. Murali Krishnan, Priti Shankar:
On the Complexity of finding Stopping Distance in Tanner Graphs. - Solomiya Buk, Andrij A. Rovenchak:
Statistical Parameters of the Novel "Perekhresni stezhky" ("The Cross-Paths") by Ivan Franko. - Louis Mello:
The Fibonacci Sequence Mod m. - John Robert Burger:
Reversible CAM Processor Modeled After Quantum Computer Behavior. - Alexandre O. Stauffer, Valmir Carneiro Barbosa:
A study of the edge-switching Markov-chain method for the generation of random graphs. - Robert K. Niven:
Combinatorial Information Theory: I. Philosophical Basis of Cross-Entropy and Entropy. - Tharaka A. Lamahewa, Rodney A. Kennedy, Thushara D. Abhayapala, Terence Betlehem:
MIMO Channel Correlation in General Scattering Environments. - Vladimir Shpilrain, Alexander Ushakov:
A new key exchange protocol based on the decomposition problem. - Enrico De Micheli, Giovanni Alberto Viano:
Metric and probabilistic information associated with Fredholm integral equations of the first kind. - David H. Wolpert:
A Predictive Theory of Games. - David Chavalarias:
Modeling Endogenous Social Networks: the Example of Emergence and Stability of Cooperation without Refusal. - Andrea Baronchelli, Luca Dall'Asta, Alain Barrat, Vittorio Loreto:
Topology Induced Coarsening in Language Games. - Samson Abramsky, Ross Duncan:
A Categorical Quantum Logic. - Paul Taylor:
Computably Based Locally Compact Spaces. - J. R. Sánchez, Ricardo López-Ruiz:
Symmetry pattern transition in cellular automata with complex behavior. - A. K. Kwasniewski:
On cobweb posets and their combinatorially admissible sequences.
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 2026-07-11 00:15 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
