Sciweavers

1308 search results - page 118 / 262
» Let's Have a Conversation
Sort
View
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 7 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 6 months ago
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications
Let A be an n by N real valued random matrix, and HN denote the N-dimensional hypercube. For numerous random matrix ensembles, the expected number of k-dimensional faces of the ran...
David L. Donoho, Jared Tanner
ENTCS
2008
142views more  ENTCS 2008»
15 years 6 months ago
An Open System Operational Semantics for an Object-Oriented and Component-Based Language
Object orientation and component-based development have both proven useful for the elaboration of open distributed systems. These paradigms are offered by the Creol language. Creo...
Jasmin Christian Blanchette, Olaf Owe
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 6 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
MANSCI
2008
96views more  MANSCI 2008»
15 years 6 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...