Publications

Found 4258 results
Author Title [ Type(Desc)] Year
Technical Report
Regier, T. (1991).  Line Labeling Using Markov Random Fields.
Alimonti, P., Feuerstain E., & Nanni U. (1992).  Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.
Dagum, P. (1989).  A Linear-Time Algorithm for Enumerating Perfect Matchings in Skew Bipartite Graphs.
Pellegrini, M. (1993).  On Lines Missing Polyhedral Sets in 3-Space.
Bourlard, H., & Wellekens C. (1988).  Links Between Markov Models and Multilayer Perceptrons.
Vinyals, O., & Friedland G. (2008).  Live Speaker Identification in Meetings:.
Shin, K. G., & Chang Y-C. (1988).  Load Sharing in Distributed Real-Time Systems with Broadcast State Changes.
Codenotti, B., & Margara L. (1992).  Local Properties of Some NP-Complete Problems.
Ladkin, P., & Crow J. S. (1990).  On Location: Points About Regions.
Nanni, U., Salza S., & Terranova M. (1992).  The LOGIDATA+ Object Algebra.
Nanni, U., Salza S., & Terranova M. (1992).  The LOGIDATA+ Prototype System.
Kushilevitz, E., Ostrovsky R., & Rosén A. (1994).  LOG-Space Polynomial End-to-End Communication.
Ablayev, F., & Karpinski M. (1997).  A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs.
Grigoriev, D. Yu., Karpinski M., der Heide F. Meyer auf, & Smolensky R. (1995).  A Lower Bound for Randomized Algebraic Decision Trees.
Grigoriev, D. Yu., & Karpinski M. (1993).  Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Decision Trees.
Grigoriev, D. Yu., Karpinski M., & Vorobjov N. (1993).  Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees.
Freivalds, R., & Karpinski M. (1994).  Lower Space Bounds for Randomized Computation.
Voisard, A., & Ziekow H. (2010).  Mātārere: A Layered Framework for Specifying Event-Based Systems.
Raghavan, B., & Hasan S. (2012).  Macroscopically Sustainable Networking: An Internet Quine.
Dagum, P. (1990).  On the Magnification of Exchange Graphs with Applications to Enumeration Problems (Thesis).
Mirghafori, N., Fosler-Lussier E., & Morgan N. (1995).  Making Automatic Speech Recognition More Robust to Fast Speech.
Raghavan, B., Koponen T., Ghodsi A., Brajkovic V., & Shenker S. J. (2012).  Making the Internet More Evolvable.
Ulrich, R. (1996).  A Management Platform for Global Area ATM Networks.
Ulrich, R., & Kritzinger P. (1996).  Managing ABR Capacity in Reservation-based Slotted Networks.
Voisard, A., & David B. (1997).  Mapping Conceptual Geographic Models Onto DBMS Data Models.

Pages