Sciweavers

4488 search results - page 72 / 898
» Properties of NP-Complete Sets
Sort
View
JSYML
2000
54views more  JSYML 2000»
13 years 7 months ago
Stationary Sets and Infinitary Logic
Let K0 be the class of structures , <, A , where A is disjoint from a club, and let K1 be the class of structures , <, A , where A contains a club. We prove that if = &...
Saharon Shelah, Jouko A. Väänänen
JC
2006
62views more  JC 2006»
13 years 8 months ago
Random non-cupping revisited
Say that Y has the strong random anticupping property if there is a set A such that for every Martin-L
George Barmpalias
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 9 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...
JMIV
2010
98views more  JMIV 2010»
13 years 6 months ago
Expectations of Random Sets and Their Boundaries Using Oriented Distance Functions
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape es...
Hanna K. Jankowski, Larissa I. Stanberry
SDM
2007
SIAM
147views Data Mining» more  SDM 2007»
13 years 9 months ago
Constraint-Based Pattern Set Mining
Local pattern mining algorithms generate sets of patterns, which are typically not directly useful and have to be further processed before actual application or interpretation. Ra...
Luc De Raedt, Albrecht Zimmermann