Sciweavers

1088 search results - page 216 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
CCS
2008
ACM
13 years 9 months ago
A general model of probabilistic packet marking for IP traceback
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
Liming Lu, Mun Choon Chan, Ee-Chien Chang
CIKM
2008
Springer
13 years 9 months ago
Probabilistic polyadic factorization and its application to personalized recommendation
Multiple-dimensional, i.e., polyadic, data exist in many applications, such as personalized recommendation and multipledimensional data summarization. Analyzing all the dimensions...
Yun Chi, Shenghuo Zhu, Yihong Gong, Yi Zhang
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
12 years 10 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...

Publication
197views
12 years 3 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
MOBISYS
2004
ACM
14 years 7 months ago
Tracking Moving Devices with the Cricket Location System
We study the problem of tracking a moving device under two indoor location architectures: an active mobile architecture and a passive mobile architecture. In the former, the infra...
Adam Smith, Hari Balakrishnan, Michel Goraczko, Ni...