Sciweavers

1017 search results - page 67 / 204
» Some existence and construction results of polygonal designs
Sort
View
BSL
2000
153views more  BSL 2000»
14 years 11 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
14 years 11 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron
ICFP
2007
ACM
15 years 12 months ago
Adding delimited and composable control to a production programming environment
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
Matthew Flatt, Gang Yu, Robert Bruce Findler, Matt...
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
16 years 5 days ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
CLUSTER
2003
IEEE
15 years 5 months ago
A General Self-Adaptive Task Scheduling System for Non-Dedicated Heterogeneous Computing
— The efforts to construct a national scale Grid computing environment have brought unprecedented computing capacity and complicacy. Exploiting this complex infrastructure requir...
Ming Wu, Xian-He Sun