: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
Dimitris Achlioptas, Jeong Han Kim, Michael Krivel...
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
The monopod hopper described here fits into a cube that is 5 cm on a side, is autonomous, and is designed to be statically and passively dynamically stable. Hopping is achieved th...
Terence E. Wei, Gabriel M. Nelson, Roger D. Quinn,...
The development of software systems is a complex process involving a variety of individual tasks, collaborative work, and lifecycle management of the resulting products and produc...
Klaus R. Dittrich, Dimitris Tombros, Andreas Geppe...
Abstract. We present a clustering method for continuous data. It defines local clusters into the (primary) data space but derives its similarity measure from the posterior distribu...