Sciweavers

271 search results - page 13 / 55
» The lattice of embedded subsets
Sort
View
DM
2002
116views more  DM 2002»
13 years 8 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
ORDER
2010
177views more  ORDER 2010»
13 years 7 months ago
Sharp and Meager Elements in Orthocomplete Homogeneous Effect Algebras
We prove that every orthocomplete homogeneous effect algebra is sharply dominating. Let us denote the greatest sharp element below x by x↓. For every element x of an orthocomple...
Gejza Jenca
TCS
2010
13 years 7 months ago
Arrows for secure information flow
This paper presents an embedded security sublanguage for enforcing informationflow policies in the standard Haskell programming language. The sublanguage provides useful informat...
Peng Li, Steve Zdancewic
ICIP
2005
IEEE
14 years 10 months ago
Bounding box splitting for robust shape classification
This paper presents a fast method to compute homeomorphisms between 2D lattices and shapes found in binary images. Unlike many other methods, this mapping is not restricted to sim...
Christian Bauckhage, John K. Tsotsos
DCC
2007
IEEE
14 years 8 months ago
Low-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...