Sciweavers

11160 search results - page 294 / 2232
» Incompleteness in a General Setting
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SI3D
2006
ACM
16 years 3 days ago
Human motion estimation from a reduced marker set
Motion capture data from human subjects exhibits considerable redundancy. In this paper, we propose novel methods for exploiting this redundancy. In particular, we set out to find...
Guodong Liu, Jingdan Zhang, Wei Wang 0010, Leonard...
CSL
2010
Springer
15 years 7 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
BMCBI
2007
108views more  BMCBI 2007»
15 years 6 months ago
Computer-aided identification of polymorphism sets diagnostic for groups of bacterial and viral genetic variants
Background: Single nucleotide polymorphisms (SNPs) and genes that exhibit presence/absence variation have provided informative marker sets for bacterial and viral genotyping. Iden...
Erin P. Price, John Inman-Bamber, Venugopal Thiruv...
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
16 years 6 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...