用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Handbook of Massive Data Sets; James Abello,Panos M. Pardalos,Mauricio G. C. Rese Book 2002 Springer-Verlag US 2002 Web Crawling.algorithm

[复制链接]
查看: 22966|回复: 51
发表于 2025-3-21 17:02:19 | 显示全部楼层 |阅读模式
书目名称Handbook of Massive Data Sets
编辑James Abello,Panos M. Pardalos,Mauricio G. C. Rese
视频video
丛书名称Massive Computing
图书封面Titlebook: Handbook of Massive Data Sets;  James Abello,Panos M. Pardalos,Mauricio G. C. Rese Book 2002 Springer-Verlag US 2002 Web Crawling.algorithm
描述The proliferation of massive data sets brings with it a series of special computational challenges. This "data avalanche" arises in a wide range of scientific and commercial applications. With advances in computer and information technologies, many of these challenges are beginning to be addressed by diverse inter-disciplinary groups, that indude computer scientists, mathematicians, statisticians and engineers, working in dose cooperation with application domain experts. High profile applications indude astrophysics, bio-technology, demographics, finance, geographi­ cal information systems, government, medicine, telecommunications, the environment and the internet. John R. Tucker of the Board on Mathe­ matical Seiences has stated: "My interest in this problern (Massive Data Sets) isthat I see it as the rnost irnportant cross-cutting problern for the rnathernatical sciences in practical problern solving for the next decade, because it is so pervasive. " The Handbook of Massive Data Sets is comprised of articles writ­ ten by experts on selected topics that deal with some major aspect of massive data sets. It contains chapters on information retrieval both in the internet and in the t
出版日期Book 2002
关键词Web Crawling; algorithms; data compression; data warehouse; image processing; information; information sys
版次1
doihttps://doi.org/10.1007/978-1-4615-0005-6
isbn_softcover978-1-4613-4882-5
isbn_ebook978-1-4615-0005-6Series ISSN 1569-2698 Series E-ISSN 2468-8738
issn_series 1569-2698
copyrightSpringer-Verlag US 2002
The information of publication is updating

书目名称Handbook of Massive Data Sets影响因子(影响力)




书目名称Handbook of Massive Data Sets影响因子(影响力)学科排名




书目名称Handbook of Massive Data Sets网络公开度




书目名称Handbook of Massive Data Sets网络公开度学科排名




书目名称Handbook of Massive Data Sets被引频次




书目名称Handbook of Massive Data Sets被引频次学科排名




书目名称Handbook of Massive Data Sets年度引用




书目名称Handbook of Massive Data Sets年度引用学科排名




书目名称Handbook of Massive Data Sets读者反馈




书目名称Handbook of Massive Data Sets读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:50:08 | 显示全部楼层
Handbook of Massive Data Sets978-1-4615-0005-6Series ISSN 1569-2698 Series E-ISSN 2468-8738
发表于 2025-3-22 02:12:08 | 显示全部楼层
Fionn Murtagh,Jean-Luc StarckAngeregt durch mehrere Fälle von Laktatazidose mit tödlichem Ausgang, die wir auf unserer Intensivstation beobachten konnten, beschlossen wir, eine kurze Studie mit laktathältigen Elektrolytlösungen zu machen. Ein Patient hat uns im besonderen dazu bewogen.
发表于 2025-3-22 05:10:44 | 显示全部楼层
发表于 2025-3-22 10:37:31 | 显示全部楼层
发表于 2025-3-22 14:17:35 | 显示全部楼层
Algorithmic Aspects of Information Retrieval on the Web been addressed in the classic information retrieval literature. This chapter will survey emerging techniques for information retrieval in the Web context and discuss some of the pertinent open problems.
发表于 2025-3-22 19:28:03 | 显示全部楼层
发表于 2025-3-23 00:06:18 | 显示全部楼层
External Memory Data Structuresneeds to be changed dynamically. In this chapter we discuss recent advances in the development of provably worst-case efficient external memory dynamic data structures. We also briefly discuss some of the most popular external data structures used in practice.
发表于 2025-3-23 02:36:26 | 显示全部楼层
Optimization Methods in Massive Data Setsn that improves generalization is implemented via an effective procedure that utilizes a polyhedral norm or a concave function minimization. Massive data is separated using a linear programming chunking algorithm as well as a successive overrelaxation algorithm, each of which is capable of processing data with millions of points.
发表于 2025-3-23 07:27:17 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-7 00:05
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表