Sciweavers

16404 search results - page 2958 / 3281
» A set coverage problem
Sort
View
RCIS
2010
15 years 4 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
WINET
2010
127views more  WINET 2010»
15 years 4 months ago
A Markov Decision Process based flow assignment framework for heterogeneous network access
We consider a scenario where devices with multiple networking capabilities access networks with heterogeneous characteristics. In such a setting, we address the problem of effici...
Jatinder Pal Singh, Tansu Alpcan, Piyush Agrawal, ...
187
Voted
ICDE
2010
IEEE
220views Database» more  ICDE 2010»
15 years 4 months ago
Profiling linked open data with ProLOD
Linked open data (LOD), as provided by a quickly growing number of sources constitutes a wealth of easily accessible information. However, this data is not easy to understand. It i...
Christoph Böhm, Felix Naumann, Ziawasch Abedj...
214
Voted
ICDM
2010
IEEE
264views Data Mining» more  ICDM 2010»
15 years 4 months ago
Block-GP: Scalable Gaussian Process Regression for Multimodal Data
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
Kamalika Das, Ashok N. Srivastava
ICDM
2010
IEEE
212views Data Mining» more  ICDM 2010»
15 years 4 months ago
Modeling Information Diffusion in Implicit Networks
Social media forms a central domain for the production and dissemination of real-time information. Even though such flows of information have traditionally been thought of as diffu...
Jaewon Yang, Jure Leskovec
« Prev « First page 2958 / 3281 Last » Next »