Sciweavers

9494 search results - page 1377 / 1899
» Gaussian Process Networks
Sort
View
MOBIHOC
2010
ACM
15 years 4 months ago
Identifying the missing tags in a large RFID system
Comparing with the classical barcode system, RFID extends the operational distance from inches to a number of feet (passive RFID tags) or even hundreds of feet (active RFID tags)....
Tao Li, Shigang Chen, Yibei Ling
SAC
2011
ACM
14 years 9 months ago
Towards discovering criminal communities from textual data
In many criminal cases, forensically collected data contain valuable information about a suspect’s social networks. An investigator often has to manually extract information fro...
Rabeah Al-Zaidy, Benjamin C. M. Fung, Amr M. Youss...
JMLR
2012
13 years 9 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
TKDE
2012
250views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 7 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
« Prev « First page 1377 / 1899 Last » Next »