Sciweavers

1778 search results - page 232 / 356
» The Theory of Probabilistic Databases
Sort
View
MP
2011
14 years 11 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
JCST
2010
189views more  JCST 2010»
14 years 11 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
AAAI
2012
13 years 7 months ago
Security Games for Controlling Contagion
Many strategic actions carry a ‘contagious’ component beyond the immediate locale of the effort itself. Viral marketing and peacekeeping operations have both been observed to ...
Jason Tsai, Thanh H. Nguyen, Milind Tambe
ICDE
2003
IEEE
247views Database» more  ICDE 2003»
16 years 5 months ago
CLUSEQ: Efficient and Effective Sequence Clustering
Analyzing sequence data has become increasingly important recently in the area of biological sequences, text documents, web access logs, etc. In this paper, we investigate the pro...
Jiong Yang, Wei Wang 0010
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
16 years 4 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez