Now showing items 1430-1449 of 1769

    • Scalable Anonymization Algorithms for Large Data Sets 

      LeFevre, Kristen; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 2007)
      k-Anonymity is a widely-studied mechanism for protecting identity when distributing non-aggregate personal data. This basic mechanism can also be extended to protect an individual-level sensitive attribute. Numerous ...
    • A Scalable Failure Recovery Model for Tree-based Overlay Networks 

      Arnold, Dorian; Miller, Barton P. (University of Wisconsin-Madison Department of Computer Sciences, 2008)
      We present a scalable failure recovery model for data aggregations in large scale tree-based overlay networks (TBONs). A TBON is a network of hierarchically organized processes that exploits the logarithmic scaling properties ...
    • Scalable Integration of Data Collections on the Web 

      Ramakrishnan, Raghu; Silberschatz, Avi (University of Wisconsin-Madison Department of Computer Sciences, 1998)
    • A Scaled Trust Region Method for a Class of Convex Optimization Problems 

      Chen, Rong-Jaye; Meyer, Robert R (University of Wisconsin-Madison Department of Computer Sciences, 1986)
    • Scan Grammars: Parallel Attribute Evaluation Via Data-Parallelism 

      Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1992)
    • Schedule - A Program that Uses Instructor and Student Preferences to Form Timetables 

      Timmreck, Eric M. (University of Wisconsin-Madison Department of Computer Sciences, 1967)
      A computer program which forms timetables from instructors' choices of times and students' choices of courses has been used by the Computer Sciences Department at the University of Wisconsin. Instructors are asked to choose ...
    • Schedulers as Abstractions-An Operating System Structuring Concept 

      Cook, Robert P (University of Wisconsin-Madison Department of Computer Sciences, 1980)
    • A Scheduling Algorithm for the Pipelined Image-Processing Engine 

      Stewart, Charles V; Dyer, Charles R (University of Wisconsin-Madison Department of Computer Sciences, 1986)
    • Scheduling Data Placement Activities in Grid 

      Kosar, Tevfik; Livny, Miron (University of Wisconsin-Madison Department of Computer Sciences, 2003)
      Todays scientific applications have huge data requirements, and these requirements continue to increase drastically every year. Furthermore, these data are generally accessed by many users from all across the country, or ...
    • Scheduling With Earliness and Tardiness Penalties 

      Ferris, Michael C.; Vlach, Milan (University of Wisconsin-Madison Department of Computer Sciences, 1990)
    • Schema Intension Graphs: A Formal Model for the Study of Schema Equivalence 

      Miller, Renee J; Ioannidis, Yannis E; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1994)
    • Searching Game Trees in Parallel 

      Steinberg, Igor; Solomon, Marvin H (University of Wisconsin-Madison Department of Computer Sciences, 1989)
      We present a new parallel game-tree search algorithm. Our approach classifies a processor�s available work as either mandatory (necessary for the solution) or speculative (may be necessary for the solution). Due to the ...
    • Secant Approximation Methods for Convex Optimization 

      Kao, C.Y.; Meyer, Robert (University of Wisconsin-Madison Department of Computer Sciences, 1979)
      The methods discussed are based on local piecewise-linear secant approximations to continuous convex objective functions. Such approximations are easily constructed and require only function evaluations rather than ...
    • Second and Higher Order Duality in Nonlinear Programming 

      Mangasarian, Olvi L. (University of Wisconsin-Madison Department of Computer Sciences, 1972)
      A dual problem associated with a primal nonlinear programming problem is presented that involves second derivatives of the functions constituting the primal problem. Duality results are derived for this pair of problems. ...
    • Secondary Flow in a Curved Tube 

      Greenspan, Donald (University of Wisconsin-Madison Department of Computer Sciences, 1972)
      The work of Dean and that of McConalogue and Srivastava on the steady motion of an incompressible fluid through a curved tube of circular cross section is extended through the entire range of Reynolds numbers for which the ...
    • Secure Programming as a Parity Game 

      Harris, William R.; Farley, Benjamin; Jha, Somesh; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2011)
      Traditionally, reference monitors have been used both to specify a policy of secure behaviors of an application, and to ensure that an application satisfies its specification. However, for recently proposed privilege-aware ...
    • Secure Programming Via Game-Based Synthesis 

      Harris, William (2015-01-16)
      Interactive security systems provide powerful security primitives (i.e., security-oriented system calls) that an application can invoke at various moments during execution to control accesses to its sensitive information. ...
    • Secure Programming via Visibly Pushdown Safety Games 

      Harris, William; Jha, Somesh; Reps, Thomas (2012-01)
      Several recent operating systems provide system calls that allow an application to explicitly manage the privileges of modules with which the application interacts. Such privilege-aware operating systems allow a programmer ...
    • Security Policy Reconciliation in Distributed Computing Environments 

      Wang, Hao; Jha, Somesh; Livny, Miron; McDaniel, Patrick (University of Wisconsin-Madison Department of Computer Sciences, 2004)
      A major hurdle in sharing resources between organizations is heterogeneity. Therefore, in order for two organizations to collaborate their policies have to be resolved. The process of resolving different policies is known ...
    • Seeking the Truth About AdHoc Join Costs 

      Haas, Laura; Carey, Michael J; Livny, Miron (University of Wisconsin-Madison Department of Computer Sciences, 1993)