CoRR, February 2007

• Pierre N. Robillard, Patrick d'Astous, Françoise Détienne, Willemien Visser:
  Measuring Cognitive Activities in Software Engineering.
  
• Jean-Marie Burkhardt, Françoise Détienne, Susan Wiedenbeck:
  The Effect of Object-Oriented Programming Expertise in Several Dimensions of Comprehension Strategies.
  
• Françoise Détienne:
  Expert Programming Knowledge: a Schema-Based Approach.
  
• Françoise Détienne:
  What model(s) for program understanding?
  
• Jean-Marie Burkhardt, Françoise Détienne:
  An empirical study of software reuse by experts in object-oriented design.
  
• Géraldine Martin, Françoise Détienne, Elisabeth Lavigne:
  Negotiation in collaborative assessment of design solutions: an empirical study on a Concurrent Engineering process.
  
• Prasanna Chaporkar, Kimmo Kansanen, Ralf R. Müller:
  Power Optimal Scheduling for Guaranteed Throughput in Multi-access Fading Channels.
  
• G. Susinder Rajan, B. Sundar Rajan:
  MMSE Optimal Algebraic Space-Time Codes.
  
• Ramji Venkataramanan, S. Sandeep Pradhan:
  On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback.
  
• Jacques Carette:
  A canonical form for some piecewise defined functions.
  
• Joseph Y. Halpern, Riccardo Pucella:
  Dealing With Logical Omniscience: Expressiveness and Pragmatics.
  
• Daria Sorokina, Johannes Gehrke, Simeon Warner, Paul Ginsparg:
  Plagiarism Detection in arXiv.
  
• Leonid Gurvits:
  Polynomial time algorithms to approximate mixed volumes within a simply exponential factor.
  
• Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
  Probabilistic Analysis of Linear Programming Decoding.
  
• Alexandros G. Dimakis, Brighten Godfrey, Martin J. Wainwright, Kannan Ramchandran:
  Network Coding for Distributed Storage Systems.
  
• Bruno Courcelle:
  A multivariate interlace polynomial.
  
• Tor Aulin:
  Comment on Improved Analysis of List Decoding and Its Application to Convolutional Codes and Turbo Codes.
  
• Matthew T. Harrison, Ioannis Kontoyiannis:
  Estimation of the Rate-Distortion Function.
  
• Maxime Gariel, John-Paul Clarke, Eric Feron:
  A Dynamic I/O Model for TRACON Traffic Management.
  
• Qinqin Yang, Zhongping Qin:
  Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups.
  
• Xing M. Wang:
  Probability Bracket Notation, Probability Vectors, Markov Chains and Stochastic Processes.
  
• Chunxi Li, Changjia Chen:
  Gnutella: Topology Dynamics On Phase Space.
  
• Sanjay Karmakar, B. Sundar Rajan:
  High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras.
  
• Michael Chertkov, Mikhail G. Stepanov:
  Searching for low weight pseudo-codewords.
  
• Markus Püschel, José M. F. Moura:
  Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs.
  
• Ravi Shankar Gautam:
  Shape preservation behavior of spline curves.
  
• Andrew Gacek:
  The Suspension Calculus and its Relationship to Other Explicit Treatments of Substitution in Lambda Calculi.
  
• Florentin Smarandache, Jean Dezert:
  Uniform and Partially Uniform Redistribution Rules.
  
• Mario Szegedy, Mikkel Thorup:
  On the variance of subset sum estimation.
  
• Nihar Jindal, Jeffrey G. Andrews, Steven Weber:
  Optimizing the SINR operating point of spatial networks.
  
• Giuseppe Caire, Nihar Jindal, Mari Kobayashi, Niranjay Ravindran:
  Quantized vs. Analog Feedback for the MIMO Downlink: A Comparison between Zero-Forcing Based Achievable Rates.
  
• Reid Andersen:
  Finding large and small dense subgraphs.
  
• Alexander Barg, Punarbasu Purkayastha:
  Bounds on ordered codes and orthogonal arrays.
  
• L. Jeganathan, Raghavan Rama:
  Graph Splicing System.
  
• Samar Agnihotri:
  New Models for the Correlation in Sensor Data.
  
• Clare Dixon, Michael Fisher, Boris Konev, Alexei Lisitsa:
  Efficient First-Order Temporal Logic for Infinite-State Systems.
  
• Minkyu Kim, Muriel Médard, Varun Aggarwal, Una-May O'Reilly, Wonsik Kim, Chang Wook Ahn, Michelle Effros:
  Evolutionary Approaches to Minimizing Network Coding Resources.
  
• Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muriel Médard, Wonsik Kim:
  Genetic Representations for Evolutionary Minimization of Network Coding Resources.
  
• Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Sylvain Petitjean:
  Hadwiger and Helly-type theorems for disjoint unit spheres.
  
• Yves Guiraud:
  Polygraphs for termination of left-linear term rewriting systems.
  
• Robert Brijder, Hendrik Jan Hoogeboom:
  The Fibers and Range of Reduction Graphs in Ciliates.
  
• Luís M. B. Lopes, Francisco Martins, Miguel S. Silva, João Barros:
  A Formal Model for Programming Wireless Sensor Networks.
  
• Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
  Deciding k-colourability of P_5-free graphs in polynomial time.
  
• Andrew M. Hunter, Jeffrey G. Andrews, Steven Weber:
  Capacity Scaling of Ad Hoc Networks with Spatial Diversity.
  
• Raúl H. Etkin, David Tse, Hua Wang:
  Gaussian Interference Channel Capacity to Within One Bit.
  
• Shenghui Su, Shuwang Lü:
  The Design, Analysis and Optimization of the REESSE1+ Public-key Cryptosystem.
  
• Holger Spakowski, Rahul Tripathi:
  Hierarchical Unambiguity.
  
• Ken Wakita, Toshiyuki Tsurumi:
  Finding Community Structure in Mega-scale Social Networks.
  
• Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh:
  Parameterized Algorithms for Directed Maximum Leaf Problems.
  
• Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber:
  Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes.
  
• Ender Tekin, Aylin Yener:
  The Gaussian multiple access wire-tap channel: wireless secrecy and cooperative jamming.
  
• Adria Tauste-Campo, Alex J. Grant:
  On Random Network Coding for Multicast.
  
• Andrew Badr, Ian Shipman:
  The DFAs of Finitely Different Languages.
  
• Christoph Dürr, Nguyen Kim Thang:
  Nash equilibria in Voronoi games on graphs.
  
• A. V. Paraskevov:
  On the possibility of making the complete computer model of a human brain.
  
• Hanene Mohamed:
  A probabilistic analysis of a leader election algorithm.
  
• Mohsen Bahramgiri, Salman Beigi:
  An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case.
  
• Kia Kai Li:
  Exploring k-Colorability.
  
• Michael B. Baer:
  Bounds on Generalized Huffman Codes.
  
• Gwénaël Richomme:
  A local balance property of episturmian words.
  
• Gwénaël Richomme:
  Sudo-Lyndon.
  
• Luca Gammaitoni:
  Noise Limited Computational Speed.
  
• Terence Chan, Alex J. Grant:
  Entropy vectors and network codes.
  
• Terence H. Chan:
  Group characterizable entropy functions.
  
• Raouf Dridi, Michel Petitot:
  Towards a New ODE Solver Based on Cartan's Equivalence Method.
  
• Matthieu Gallet, Yves Robert, Frédéric Vivien:
  Comments on "Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks".
  
• Fionn Murtagh:
  The Haar Wavelet Transform of a Dendrogram: Additional Notes.
  
• Gesualdo Scutari, Sergio Barbarossa, Loreto Pescosolido:
  Distributed Decision Through Self-Synchronizing Sensor Networks in the Presence of Propagation Delays and Nonreciprocal Channels.
  
• Roberto M. Amadio, Frederique Dabrowski:
  Feasible reactivity in a synchronous pi-calculus.
  
• Maria Fresia, Giuseppe Caire:
  A Practical Approach to Lossy Joint Source-Channel Coding.
  
• Pulkit Grover, Anant Sahai:
  What is needed to exploit knowledge of primary transmissions?
  
• Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
  Logic Programming with Satisfiability.
  
• Pulkit Grover:
  Tradeoff between decoding complexity and rate for codes on graphs.
  
• Josep Díaz-Giménez, Dieter Mitsche, Xavier Pérez:
  Dynamic Random Geometric Graphs.
  
• Maurice H. T. Ling:
  Firebird Database Backup by Serialized Database Table Dump.
  
• Lionel Eyraud-Dubois, Arnaud Legrand, Martin Quinson, Frédéric Vivien:
  A First Step Towards Automatically Building Network Representations.
  
• Maximilien Gadouleau, Zhiyuan Yan:
  Properties of Rank Metric Codes.
  
• Reid Andersen:
  A Local Algorithm for Finding Dense Subgraphs.
  
• Otfried Cheong, Mira Lee:
  The Hadwiger Number of Jordan Regions is Unbounded.
  
• Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
  Sparse geometric graphs with small dilation.
  
• Rick Dale:
  Random Sentences from a Generalized Phrase-Structure Grammar Interpreter.
  
• Ivan Tyukin, Tatiana Tyukina, Cees van Leeuwen:
  Invariant template matching in systems with spatiotemporal coding: a vote for instability.
  
• Alexander Serebrenik, Tom Schrijvers, Bart Demoen:
  Improving Prolog programs: Refactoring for Prolog.
  
• Bozidar Radunovic, Jean-Yves Le Boudec, Raymond Knopp:
  Performance of Ultra-Wideband Impulse Radio in Presence of Impulsive Interference.
  
• Vincenza Carchiolo, Michele Malgeri, Giuseppe Mangioni, Vincenzo Nicosia:
  Social Behaviours Applied to P2P Systems: An efficient Algorithm for Resource Organisation.
  
• Nicolai Kuntze, Andreas U. Schmidt:
  Protection of DVB Systems by Trusted Computing.
  
• Marc Glisse, Sylvain Lazard:
  An Upper Bound on the Average Size of Silhouettes.
  
• Xi Chen, Shang-Hua Teng:
  Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation.
  
• C. Maria Keet:
  Mapping the Object-Role Modeling language ORM2 into Description Logic language DLRifd.
  
• Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
  Aperture-Angle and Hausdorff-Approximation of Convex Figures.
  
• Raphael M. Jungers, Vincent D. Blondel:
  Observable Graphs.
  
• Yucel Altug, N. Polat Ayerden, Mehmet Kivanç Mihçak, Emin Anarim:
  A Note on the Periodicity and the Output Rate of Bit Search Type Generators.
  
• Ashish Khisti, Aslan Tchamkerten, Gregory W. Wornell:
  Secure Broadcasting.
  
• Darko Fuduric, Marko Horvat, Mario Zagar:
  Authentication via wireless networks.
  
• Ayan Mahalanobis:
  A note on using finite non-abelian p-groups in the MOR cryptosystem.
  
• David Iclanzan, Dan Dumitrescu:
  Overcoming Hierarchical Difficulty by Hill-Climbing the Building Block Structure.
  
• M. D. Atkinson, Hans P. van Ditmarsch, S. Roehling:
  Avoiding bias in cards cryptography.
  
• Jari Salo:
  A Sum-Product Model as a Physical Basis for Shadow Fading.
  
• Ruoheng Liu, Ivana Maric, Predrag Spasojevic, Roy D. Yates:
  Discrete Memoryless Interference and Broadcast Channels with Confidential Messages: Secrecy Rate Regions.
  
• Sundaram Vanka, M. J. Dehghani, K. M. M. Prabhu, R. Aravind:
  A Class of Multi-Channel Cosine Modulated IIR Filter Banks.
  
• Neri Merhav:
  An identity of Chernoff bounds with an interpretation in statistical physics and applications in information theory.
  
• Bruce Hajek, Kevin Mitzel, Sichao Yang:
  Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm.
  
• Dirk Lewandowski, Philipp Mayr:
  Exploring the academic invisible web.
  
• Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ian J. Wassell, Rolando A. Carrasco:
  A Union Bound Approximation for Rapid Performance Evaluation of Punctured Turbo Codes.
  
• David L. Donoho, Hossein Kakavand, James Mammen:
  The Simplest Solution to an Underdetermined System of Linear Equations.
  
• Robert Charles, Adigun Ranmi:
  Wild, Wild Wikis: A way forward.
  
• Charles A. Robert:
  AMIEDoT: An annotation model for document tracking and recommendation service.
  
• Wenyi Zhang, Urbashi Mitra:
  Orthogonal Codes for Robust Low-Cost Communication.
  
• Charles A. Robert, Amos David:
  AMIE: An annotation model for information research.
  
• Saltuk Aksahin:
  Security Implications of Converged Networks and Protecting Them, without Compromising Efficiency.
  
• Andres I. Vila Casado, Miguel Griot, Richard D. Wesel:
  Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes.
  
• Ender Tekin, Aylin Yener:
  The General Gaussian Multiple Access and Two-Way Wire-Tap Channels: Achievable Rates and Cooperative Jamming.
  
• David Pritchard:
  How to Use Random Circulations to Find Small Cuts.
  
• David Pritchard:
  Nearest Neighbor Network Traversal.
  
• Rajesh Sundaresan:
  Guessing based on length functions.
  
• David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu:
  The Bedwyr system for model checking over syntactic expressions.
  
• Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
  On a family of strong geometric spanners that admit local routing strategies.
  
• Kwankyu Lee:
  Interpolation-based Decoding of Alternant Codes.
  
• G. Raju Renjit:
  Solution of Ulam's Conjecture for Connected Graphs.
  
• Joël Ouaknine, James Worrell:
  On the decidability and complexity of Metric Temporal Logic over finite words.
  
• Xing M. Wang:
  Induced Hilbert Space, Markov Chain, Diffusion Map and Fock Space in Thermophysics.
  
• Thomas Michel, Gerhard Wunder:
  Transmitter and Precoding Order Optimization for Nonlinear Downlink Beamforming.
  
• Slavcho Shtrakov, Vladimir Shtrakov:
  Tree automata and separable sets of input variables.
  
• Mohsen Bayati, Jeong Han Kim, Amin Saberi:
  A Sequential Algorithm for Generating Random Graphs.
  
• Philipp Pluch, Samo Wakounig:
  Bayesian Network Tomography and Inference.
  
• Vincenzo Nicosia, Giuseppe Mangioni, Vincenza Carchiolo, Vincenza Malgeri:
  Efficient Searching and Retrieval of Documents in PROSA.
  
• Vincenzo Nicosia, Giuseppe Mangioni, Vincenza Carchiolo, Vincenza Malgeri:
  Exploiting social networks dynamics for P2P resource organisation.
  
• Xiangao Huang, Wei Huang, Xiaozhou Liu, Chao Wang, Zhu jing Wang, Tao Wang:
  Reconstructing the Nonlinear Filter Function of LILI-128 Stream Cipher Based on Complexity.
  
• Slavcho Shtrakov:
  Tree Automata and Essential Input Variables.
  
• Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
  Syndrome Decoding of Reed-Solomon Codes Beyond Half the Minimum Distance based on Shift-Register Synthesis.
  
• Graham B. Macpherson, Jason M. Reese:
  AICA: a New Pair Force Evaluation Method for Parallel Molecular Dynamics in Arbitrary Geometries.
  
• Vikram Chandrasekhar, Jeffrey G. Andrews:
  Uplink Capacity and Interference Avoidance for Two-Tier Femtocell Networks.
  
• Vadim Yatsenko:
  Fast Exact Method for Solving the Travelling Salesman Problem.
  
• Pankaj Sati:
  Patterns of technological progress: A Predictability-Based Perspective.
  
• Simon Portegies Zwart, Robert G. Belleman, Peter Geldof:
  High Performance Direct Gravitational N-body Simulations on Graphics Processing Units.
  
• Ivo Damyanov, Slavcho Shtrakov:
  Essential Inputs and Minimal Tree Automata.
  
• Slavcho Shtrakov:
  Tree Automata and Essential Subtrees.
  
• Joakim Jalden, Björn E. Ottersten:
  On the Maximal Diversity Order of Spatial Multiplexing with Transmit Antenna Selection.
  
• Tor Helleseth, Alexander Kholosha, Geir Jarle Ness:
  Characterization of m-Sequences of Lengths $2^{2k}-1$ and $2^k-1$ with Three-Valued Crosscorrelation.
  
• Dennis M. Wilkinson, Bernardo A. Huberman:
  Assessing the Value of Coooperation in Wikipedia.
  
• Tanya L. Crenshaw, Erin W. Chambers, Heather Metcalf, Umesh Thakkar:
  Recruitment, Preparation, Retention: A case study of computing culture at the University of Illinois at Urbana-Champaign.
  
• Daniel Lemire, Martin Brooks, Yuhong Yan:
  An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation.
  
• Owen Kaser, Daniel Lemire:
  Attribute Value Reordering For Efficient Hybrid OLAP.
  
• Daniel Lemire, Anna Maclachlan:
  Slope One Predictors for Online Rating-Based Collaborative Filtering.
  
• Srikumar Venugopal, Krishna Nadiminti, Hussein Gibbins, Rajkumar Buyya:
  Designing a Resource Broker for Heterogeneous Grids.
  
• Weiyu Xu:
  A Local Tree Structure is NOT Sufficient for the Local Optimality of Message-Passing Decoding in Low Density Parity Check Codes.
  
• Weiyu Xu, Babak Hassibi:
  On the Complexity of Exact Maximum-Likelihood Decoding for Asymptotically Good Low Density Parity Check Codes.
  
• Roderick V. N. Melnik:
  Linking Microscopic and Macroscopic Models for Evolution: Markov Chain Network Training and Conservation Law Approximations.
  
• Roderick V. N. Melnik:
  Coupling Control and Human-Centered Automation in Mathematical Models of Complex Systems.
  
• Robert M. Gray, Takeshi Hashimoto:
  A note on rate-distortion functions for nonstationary Gaussian autoregressive processes.
  
• Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo:
  Succinct Sampling on Streams.
  
• Andrew Gacek, Gopalan Nadathur:
  A Simplified Suspension Calculus and its Relationship to Other Explicit Substitution Calculi.
  
• Kyle W. Burke, Shang-Hua Teng:
  Games on the Sperner Triangle.
  
• Lawrence Ong, Mehul Motani:
  On the Capacity of the Single Source Multiple Relay Single Destination Mesh Network.
  
• Maurice Margenstern:
  On a characterization of cellular automata in tilings of the hyperbolic plane.
  
• Fabrice Guillemin, Philippe Robert:
  On the Discovery of Random Trees.
  
• Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster, Anne Rogers:
  In Search of Simplicity: A Self-Organizing Multi-Source Multicast Overlay.
  
• Yunxia Chen, Qing Zhao, Ananthram Swami:
  Joint Design and Separation Principle for Opportunistic Spectrum Access in the Presence of Sensing Errors.
  
• Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani:
  Perfect Hashing for Data Management Applications.
  
• François Pitt:
  A Quantifier-Free String Theory for ALOGTIME Reasoning.
  
• Ying Wang, Pierre Moulin:
  Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions.
  
• Jong-Shi Pang, Gesualdo Scutari, Francisco Facchinei, Chaoxiong Wang:
  Distributed Power Allocation with Rate Constraints in Gaussian Frequency-Selective Interference Channels.
  
• Di Zhang, Roderick V. N. Melnik:
  First Passage Time for Multivariate Jump-diffusion Stochastic Models With Applications in Finance.
  
• Di Zhang, Roderick V. N. Melnik:
  Monte-Carlo Simulations of the First Passage Time for Multivariate Jump-Diffusion Processes in Financial Applications.
  
• Di Zhang, Roderick V. N. Melnik:
  Efficient estimation of default correlation for multivariate jump-diffusion processes.
  
• Di Zhang, Roderick V. N. Melnik:
  Solving Stochastic Differential Equations with Jump-Diffusion Efficiently: Applications to FPT Problems in Credit Risk.
  
• Linxiang X. Wang, Roderick V. N. Melnik:
  Finite Volume Analysis of Nonlinear Thermo-mechanical Dynamics of Shape Memory Alloys.
  
• Linxiang X. Wang, Roderick V. N. Melnik:
  Simulation of Phase Combinations in Shape Memory Alloys Patches by Hybrid Optimization Methods.
  
• James Laird:
  Bistable Biorders: A Sequential Domain Theory.
  
• Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh:
  Generic Global Constraints based on MDDs.
  
• Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
  How Overlap Determines the Macronuclear Genes in Ciliates.
  
• Linxiang X. Wang, Roderick V. N. Melnik:
  Numerical Model For Vibration Damping Resulting From the First Order Phase Transformations.
  
• Elitza N. Maneva, Talya Meltzer, Jack Raymond, Andrea Sportiello, Lenka Zdeborová:
  A Hike in the Phases of the 1-in-3 Satisfiability.
  
• Florent Krzakala, Jorge Kurchan:
  A Landscape Analysis of Constraint Satisfaction Problems.
  
• Enzo Marinari, Guilhem Semerjian, Valery Van Kerrebroeck:
  Finding long cycles in graphs.
  
• M. Tentyukov, J. A. M. Vermaseren:
  The Multithreaded version of FORM.
  
• Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
  Longest Common Separable Pattern between Permutations.
  
• Audrey Lee, Ileana Streinu:
  Pebble Game Algorithms and Sparse Graphs.
  
• David Bremner, Mathieu Dutour Sikiric, Achill Schürmann:
  Polyhedral representation conversion up to symmetries.
  
• Martin J. Wainwright:
  Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting.
  
• Olivier Finkel:
  An Example of Pi^0_3-complete Infinitary Rational Relation.
  
• Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
  Matrix norms and rapid mixing for spin systems.
  
• Patrick Letrémy, Marie Cottrell, Eric Esposito, Valérie Laffite, Sally Showk:
  Consumer Profile Identification and Allocation.
  
• Ricardo López-Ruiz, Daniele Fournier-Prunaret:
  Bistability: a common feature in some "aggregates" of logistic maps.
  
• Alex Arenas, J. Duch, A. Fernandez, Sergio Gómez:
  Size reduction of complex networks preserving modularity.
  
• Pierfrancesco La Mura, Lukasz Swiatczak:
  Markovian Entanglement Networks.
  
• Marcus Hutter:
  The Loss Rank Principle for Model Selection.
  
• Oskar Sandberg:
  Neighbor Selection and Hitting Probability in Small-World Graphs.
  

Last update Tue May 21 18:37:49 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page