Sciweavers

315 search results - page 23 / 63
» A General Small Cancellation Theory
Sort
View
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
CVPR
2008
IEEE
14 years 9 months ago
Shading models for illumination and reflectance invariant shape detectors
Many objects have smooth surfaces of a fairly uniform color, thereby exhibiting shading patterns that reveal information about its shape, an important clue to the nature of the ob...
Peter Nillius, Josephine Sullivan, Antonis A. Argy...
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 7 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
SAC
2009
ACM
14 years 2 months ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 2 months ago
Insight knowledge in search based software testing
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
Andrea Arcuri