2013年4月26日星期五

揭秘中国地下互联网世界的冰山一角

转文,实际上许多情况并没有在这篇文章中写出来,比如基于互联网的地下博彩

"质疑的人或许并非无知,只是事情超过了他们的认知范围。中国互联网的三个世界,在地下世界发生地事情,地面上的人永远不知道是怎么回事。"

  而关于"中国互联网"的三个世界,Fenng也早在2012年年初就提到过这个归类方法:"在中国,存在三个互联网形态。一种是媒体给人灌输的互联网,以海外IPO为目标的;一种是草根互联网,低调掘金,如迅猛龙般彪悍;一种是深藏地下的互联网。"

  这个分法,大致上是合理的,如果对应其实际的案例,第一类是属于"空中互联网",通常保持在媒体视野之内活动,有着从西方借鉴过来的成熟的商业 模式,比如大家熟知的百度淘宝微博等。第二类是"地面互联网",贴着地气生长出来的原生态产物,极具草根和市井特色,一般都在埋头挣钱,鲜有媒体关注―― 过多的媒体关注对它们而言也不算利好之事,代表有9158(年营收破10亿的视频交友网站)、5173(中国最大的网络游戏交易平台)、雨林木风(以盗版 Windows系统发家,现已洗白)等。

  第三类的"地下互联网",尽管涉及许多见不得光、游离在法律边缘的行当,但它也并不完全等同于一个在阳光照射不到之处滋生繁殖的法外之地,其中 的从业者通常都以平常面貌生存在大众群体中间,即使你和他们面对面的相逢然后擦肩而过,不会留下任何深浅的记忆。更多时候,无论是为了自保还是业务的安全 需求,他们都不会主动的浮到地面上头让人发现。然而,在很多时候,地下互联网都无意中直接或者间接的影响着普通网络用户的生活环境,甚至参与制定过一些地 上互联网世界也必须遵从的规则。

  在这里,我可以讲一下我所接触或者经历过的,地下互联网庞大冰山里的三座山头,它们平时可能只是以书面上的词汇形式为人所知,然而,毫不夸张的说,它们真正意义上左右着中国互联网的某些时局。

  第一座山头,叫做"黑客(Hacker)"。

  在理论上,目前对于黑客的定义存在着比较重大的误读,简单来说,这个源自美国计算机业界的舶来名词本意上是用来形容对计算机技术有着深入研究、 捍卫自由共享的网络精神、偶尔会利用技术优势做做恶作剧的电脑高手。只是猛兽易伏,人心难降,在私欲的牵引下,有些具备黑客技术的人走上了恶意破解商业软 件、入侵服务器系统以谋取利益的道路,这些人被称为Cracker,而这里所讲述的山头,正是Cracker的领地,但是为了便于理解,暂时也将 Cracker译为黑客,大家知道实际区别就好。

  许多媒体曾经或多或少披露过的"黑客"新闻,多半也是属于这类,在媒体的笔端,这类黑客似乎都是来自鼠标和键盘的混种天才,足不出户便能闯入任 意网民的电脑里,盗取各种信息资料,或是轻易入侵各大网站,还能删改网站首页留下"到此一游"的得意战绩。这些报道,多以道听途说、或是采访已被公安抓捕 的网络敲诈犯为信息来源,既有夸大之处――黑客通常必须要有"木马"等程序作为桥梁进行入侵,否则无法单凭网线就去操作任意指定用户的电脑,也不乏低估的 地方――很多因为犯事而被曝光的小黑客其实属于黑客产业链的最下游,只是凭借在交易平台购买的暴力破解或攻击软件,以极小几率入侵了某些防御力量实在薄弱 的网站数据库,实现了盗取帐号密码的目的。

  真正入流的顶级黑客,他们其实都是一群生意人。

  生意人有个特点,他们擅长玩的是交易,用一些东西换另一些东西,再用另一些东西换别的更多东西,最后获得自己想要的最大利益,而这个看似是技术密集型的行当,在他们的掌控下沦为了一个劳动密集型的行当。

  2009年5月19日,这是中国互联网历史上的一个标志性刻度。有印象的网民应该都还记得,在这一天晚上9点左右,全国范围内出现了大面积断网 事件,超过23个省份陆续出现网络中断或访问受阻的现象,持续了数个小时之久。而后,电信运营商和工信部把黑锅盖到了暴风影音头上,称"由于暴风影音客户 端软件存在缺陷,在暴风影音域名授权服务器工作异常的情况下,导致安装该软件的上网终端频繁发起域名解析请求,引发DNS拥塞,造成大量用户访问网站慢或 网页打不开。"而事情背后的真相却是,暴风影音虽然也应当为此承担部分责任,但它的确也是货真价实的受害者之一,后来也有少数媒体对事件缘由作了较深的挖 掘,发现是黑客在攻击DNS服务商的时候,致其服务器宕机,而暴风影音的域名解析正好处在这台服务器上,而拥有千万级用户规模暴风影音当时会在用户的计算 机上残留一个用于监测状态和弹出广告的进程,这个进程在回传信息的时候遇到服务器堵塞,继而因为暴风影音的设定机制不断累计往回发送请求,最后直接弄瘫了 中国电信的DNS服务器,让全国网友都断了网。

  为什么黑客攻击能够引起如此震动的影响?这背后的利益关系核心,却是另一个行业:网络游戏。当然,在这里所称的网络游戏,并非指的是正规的网络 游戏产品,而是所谓的"私服"。中国曾经最大的网络游戏产品《传奇》在源代码发生泄漏之后,实际上就变相的成为了一个"开源"的游戏产品,任何稍具技术的 用户都能自主的搭建《传奇》游戏的私人服务器,提供经过修改后的、在某些方面比官方更加"刺激"的《传奇》游戏。而基于庞大的用户付费基础,中国大地上如 雨后春笋般一度出现了千万个《传奇》私服――具体数字比后来的团购网站巅峰数量更多,于是有些大的黑客就盯上了这个群体。

  《传奇》私服在宣传时一般都需要搭建一个网站,用来提供游戏服务器的IP或登录器下载――这是用户进入其游戏的唯一入口,而黑客就瞄准了这个为 私服运营者提供收入支持中不可或缺的入口,每天扫描新开的私服网站,向手底下的"操作者"发送攻击指令,后者通过常规DDOS或其他更高明点的手段将目标 私服的网站攻击瘫痪,中断用户入口,再联系私服运营者,索要数千甚至上万元的"放弃费"。如若遭到拒绝,则进一步攻击游戏服务器,导致玩家无法正常游戏, 彻底断掉私服运营者的财路。高峰时期,中国每天都有上百万台服务器受到这类黑客的操控,用于威慑和打击私服网站及服务器,而私服运营者方面因为本身就是违 法生意,根本无法寻求警方协助。(这从侧面似乎也证明了私服行业的惊人暴利,在黑客、官方的双重打击下仍能前仆后继……)

  而519断网事件,就是由一伙黑客在打某家《传奇》私服的时候,直接攻击到了后者服务器所在的DNS服务商身上,进而引发暴风影音的连锁反应, 酿成大祸。这也让工信部第一次意识到了互联网在政治之外的风险,曾有网警单位试图打入黑客关系以及病毒产销链的内部,但皆因身份伪装失败而遭泄漏,不过也 起到了一定的威慑作用。2010年3月,工信部低调推出了中国通信行业网络安全的首个部级指令《通信网络安全防护管理办法》,确定了电信管理机构的行政权 力,还给公安部门下了任务指标,不少地区兴起"抓捕黑客"热,最终的结果可想而知:一些在网吧里自学简陋的攻击软件的青年被当作涉案重量级黑客锒铛入狱, 而真正有能力的黑客则开始将研究重点由"入侵"转移到"隐匿"上,反倒间接的推动了中国加密数据网络技术的水平提升。

  还有更多单打独斗的黑客从事的是"信封"交易,通过自己编写的软件将恶意代码注入某些防范不严的网站数据库,造成用户数据的外泄(或者入侵大型 网站后在网页上挂木马)。2011年年底CSDN遭到"拖库"攻击被黑客拉出600万用户的明文帐号密码,即为一例。经过这种方式拿到的帐号和密码,通常 会由黑客使用另外的程序进行各种主流的软件或游戏进行交叉验证,比如,你在某论坛的帐号和密码被捕捉到之后,黑客会用此帐号和密码去撞QQ、各大邮箱、各 大网络游戏等地,如果恰好有人帐号和密码在这些地方亦保持一致的话,则被封装为信,成为一件商品。这些被称为"信封"的文件被拿到批发市场上进行交易,由 购买者再去挖掘更多用途的价值――比如购买了某网游信封后,就可以去盗取该网游帐号的装备,而在购买了某QQ信封后,则可以操纵这些QQ号去找好友行骗等 等。一名已经洗手不干的黑客曾透露说,中国市场上待价而沽或正在交易的"信封"超过了二十亿封,年产值在百亿人民币规模。

  逐利的黑客更有着"养号"的习俗,若是将木马或者后门程序种到用户的计算机内,则会盯上一些暂时没有价值、但可能会有升值空间的资料,比如级别 并不高的网游帐号,待到该帐号成长起来产生价值之后再来"收割"。这类黑客倒是对360等安全软件抱有某种程度上的"谢意",因为就他们的样本来看,没有 安装安全软件的用户,重装系统的频率要比装了安全软件的用户高出太多――很多用户会将重装系统当作清理电脑的一项手段,而重装系统对于90%以上的本地木 马或是后门程序都有着毁灭性的打击。

  在中国,广东、福建是黑客聚集较多的地区,产业链上游的黑客,基本上都有着实业,我所知道的一名黑客,人长得非常普通――丢到人群里扫过去基本 上不会留下印象的那种,开着三家夜总会和一个茶庄,泡着古玩和书画市场,每个月抽一天的时间去他控制的工作室查账、开会,连他的老婆都不知道他的真实面 貌。还有一名黑客,白天在一所专业学校里教计算机课程,曾在一个晚上打掉某著名游戏厂商的整个数据库,被该游戏厂商悬红百万人民币通缉,而他就在自己被通 缉的期间,迎娶了该游戏厂商的一名女策划,后者对他愤恨说某黑客让自己公司蒙受损失并影响了自己的年终奖,他只是笑着安慰。

  在黑客这个圈子,大的瞧不起小的,认为后者太过张狂,不仅扰乱市场,而且会招来不必要的政府关注。而小的都憧憬大的,并希望自己能够早日成为大 的,所以常有急功近利的事情发生。一名年仅十九岁的黑客曾经黑掉了某个地区政府的官方网站,目的只是想要将成果展示给他的朋友欣赏,后来他被警察逮到,预 计直到不惑之年才能再见天日。

  另外,在媒体的渲染下让很多人谈"黑"色变的直接盗取网银钱财的黑客行为并不多见,因为此时,黑客的攻击对象并不是毫无议价能力的普通用户,而 是国家金融机构,一旦被发现,后果不太能够承受,而且当越来越多的网银将手机验证作为交易环节之一,网银的壁垒也的确相对较高。与其冒着风险和难度来入侵 银行的对外系统,一些小黑客更喜欢借助钓鱼页面的形式来诱导用户在虚假的网站上展开交易,再来借机引导被欺瞒的用户将钱打入指定账户。而大点儿的黑客,他 们可以私下演示如何入侵大型商业公司甚至国家安全系统的能力,但是一般不会动里面的东西,只是不留痕迹的出入而已。

  基本上,因为某些行规和自我保护的因素,中国的黑客圈子秘密很多,外流的极少,甚至有时会有意放出一些极其夸张或者与事实大相径庭的消息,干扰 外界视线,达到隐蔽目的。他们大多认为黑客是一门吃青春饭的生意,希望早日当上"老板",指挥后辈在前线冲锋陷阵,自己坐享其成,而出于职业习惯,他们也 对生活中的许多事物保持相当高的敏感神经,每周注册一个新的QQ、重要代码写在本子上不往电脑里存、笔记本电脑的摄像头永远贴着不透明的胶布等,都是常见 的现象,因为过度紧张和集中注意力,神经衰弱、睡眠质量奇差、脾气不好都是黑客们的职业病。

  接下来要说的第二座山头,叫作"色情(Porn)"。

  在世界上的绝大多数国家,色情业都是合法的存在,而在中国,由于国家体制的原因,色情业仍然处于法律的敌对阵营里。但是,食色性也,作为人性的 原始需求,色情网站满足了网民对于欲望的部分需求,根据BusinessInsider的一份报告数据显示,色情网站占全球网站整体数量的12%,其总体 流量占比可能逼近整个互联网流量的三成左右。

  尽管在中国,色情行业(及网站)都是非法产物,但这也无法遏制某些城市成为举世闻名的"性都",也造就了如草榴社区这样的色情网站集群。

  草榴社区创建于2006年,服务器在美国的科罗拉多州,时值中国曾经最大的色情论坛情色六月天东窗事发――其服务器虽然设在美国,但是论坛的主 要管理员却都是不折不扣的中国人,又因内部斗争(主要为收入的分配)而造成不和,最后被山西省公安厅将部分论坛管理者抓获在案。草榴社区充分吸收了前辈失 足的经验和教训,基本上不会设置太多的论坛管理者角色,即使需要存在的某些拥有管理权限的帐号,也都是不会在社区里发言和互动的(早期有过,但是后来就隐 匿掉了),这样就尽可能的避免了信息外泄或者产生纷争的风险。而草榴社区的实际控制者,都有着海外国籍,受到他国法律保护。

  因为目睹太多由利益而起的纠纷最终牵连网站的案例,加上草榴的主要创始人(几名美籍华人)家境尚好本就不算缺钱,所以并没有在盈利上花太大功 夫。因为草榴社区一直是免费运营的政策――除了小范围内的展示型广告、网盘链接分成之外,都没有太多商业化的机制,这使得草榴社区的"名声"一直很好,一 个不弹广告窗口、也不限定用户购买VIP方可浏览的色情论坛,怎么可能不受欢迎呢?2011年6月,草榴社区曾经尝试开放注册一天,结果一夜之内多了十三 万新注册用户,管理方发现这样下去数据库会崩溃,于是就继续采用邀请注册的机制至今。

  但是草榴社区并非是中国色情网站行业的翘楚,它只是色情影片进行分销的一个主要渠道,更上游的,是那些收费运营、更加隐蔽的色情网站。借助 P2P的共享模式,下载色情影片成为了中国网民接触色情信息的主流方式,而影片并非凭空出现的,它的片源在日本、欧美等国家以商品的形式存在,那么这中间 就需要当地华人掏钱去将光碟购买下来,再将其转码成为网络流行的AVI或RMVB等文件格式,制作成种子之后上传到色情网站提供P2P下载,这些人属于 "发片员"。"发片员"少数是义务性质,大多还是会从色情网站的运营方那里拿到费用补贴,而后者则利用他们带来的影片更新内容,吸引用户下载、传播、付 费。而有些用户则以这些种子作为资源,将其分享到草榴社区等网站,造就了后者的繁荣。

  能力出众的"发片员",甚至会在论坛里享有至高的特权,比如18P2P著名的"nike"(用户ID),这是一名香港网友,本身从事的就是色情 影片光碟租售业务(在香港合法),因其能够以每天几十G的网络发片规模持续了好几年而闻名于世,在网络上一度有80%以上的日本有码片源都是出自他那里。 18P2P对此贵客也是多方担待,明文告示任何人不得打扰nike,包括在其帖子下面回复攻击性言论、或是发送论坛短消息给他求片等,都会直接遭到封杀 ID的处理。nike最终因为自己要结婚以及其最爱的AV女优松岛枫传出退役消息,而退出江湖,真正的"深藏功与名",只留下传说。

  苍井空在中国走红,日本AV圈内其实是不太待见的,因为作为一个在日本完全合法的行业,色情影视业仍然是一个通过销售光碟赖以为生的产业,对从 业者、发行商的回报完全由顾客购买决定。色情AV在中国市场几乎是一个纯P2P的分享模式,在一个无视版权、甚至连色情本身都不合法的国家转而借助从影片 中积累的名声进行变现,无疑释放出一种"鼓励中国人继续盗版日本的色情AV"的信号。不过苍井空也只是个案,无论是政治还是性文化上都呈保守姿态的中国, 对待色情产业并未出现与它对待其他经济产业表现出"大力招商引资"的积极态度,2CH(日本最大的综合社区)上曾有一名日本网友十分疑惑,"为什么中国可 以将土壤和河流都污染到百年后仍会残留剧毒的程度,却在色情信息上试图建设一个谁都知道真相但谁都不说出真相的伊甸园呢?"除了苍井空之外,与中国走得比 较近的,还有常被中国一些酒吧请来站台甚至还和某情趣用品品牌合作亲自充当模特的小泽玛莉亚、分别出演过香港电影《3D肉蒲团》和《一路向西》的原纱央莉 和希崎杰西卡、以及同样在新浪微博上拥有大批拥趸的长相酷似周杰伦的AV男优东尼大木等人。

  在中国市场,运营得比较好的色情网站,一年收入大概可以达到千万人民币的规模,扣掉服务器及兼职人员(版主、发片员等)的成本,运营方可以入手 数以百万计的净利,如果除开法律隐患,还是非常吸引人的,而且色情网站的运营方能够收获独有的荣誉感――整个社区的用户都将管理员们当做神一般进行膜拜, 这种体验更是让人很为受用。去年,某色情网站的一名版主(美籍华人)回国探亲,天天都有当地网友排着队请其吃饭,其中不乏富有的私企老板,开着奔驰带他体 验家乡变化,还说"虽然(自己)现在也常远赴东莞,但是发迹之前都是靠着他(指这名版主)在论坛上发的片子度日,实在感激不尽……"

  除此之外,还有一些网友并不满足于对着电脑屏幕的异国女优浪费卫生纸,于是有着更多类型的网络经济,用于迎合这种寂寞和欲望交织的需求,包括真 人视频、买春交流、夫妻换偶等。但由于更加踩住了法律的黄线,所以多数都只局限于小圈子范围内,除非运营方想钱想疯了,否则不会做出过多的声张。我认识一 名无业的中年男性,全靠他的妻子通过在网上出售原味丝袜养活,一个月的家庭收入可以超过30万人民币。

  地下互联网世界的第三座山头,是"黑公关(Gangsterdom PR)"。

  和"骇客(Cracker)"牵连了"黑客(Hacker)"一样,"黑公关(Gangsterdom PR)"也干扰到了人们对于"公关(PR)"的定义和看法。

  "公关(Public Relations,简称PR)"是由美国传媒行业在20世纪初创造出来的概念,属于管理功能,意指"组织机构与公众环境之间的沟通与传播关系",随着舆 论经济的发达、Edward L.Bernays这类学者的推动以及《公关第一,广告第二》等营销经典教材的风靡,正式成为政府和企业的一门必修课。

  从事公关行业能够明显察觉,公关对于其理念的忠实程度和它所在的地缘政治的媒体自由及社会民主程度呈标准的正比趋势。也就是说,一个国家或者地 区的媒体越是落后、越受限制,政治体制距离民主精神越远,那么公关在这片土壤上就越容易演变成为一个与其原生概念完全不同的产物。这个不仅是在公关行业, 干过啤酒渠道拓展业务的应该也都能体会,想要在中国一个县级城市的餐馆里推广某个品牌的啤酒,与其啤酒的口味、品牌、广宣等内容都完全无关,只要搞定当地 负责某个片区的地头蛇,后者自然会带着人马去帮你规定区域内的餐馆必须买进什么啤酒。

  在中国互联网这个受法律和体制约束更小的世界里,有很多实际上是公关无法实现的功能需求,都是在由"黑公关"以"公关"的名义在行事。和"黑客"利用技术实现目的的方式不同,"黑公关"里的技术含量甚少,更多的是在四两拨千斤,用资源作为杠杆,对目标进行打击和讹诈。

  土豆网本在2010年――纳斯达克中概股最热的时期赴美上市,土豆网创始人王微遭 遇前妻杨蕾半路截杀,要求分割土豆网38%的股权,上海徐汇区法院冻结了王微名下所持有土豆网的股份,直接逼停土豆网的上市进程。等到王微自掏700万美 元现金补偿的期间,优酷网成为中国首家赴美上市的独立视频分享网站,一年之后,土豆网重启IPO时迎来中概股遇冷,"流血上市"的结果是让土豆网和优酷网 这两家本是不相伯仲的视频网站在纳斯达克的市值几乎呈1:5的比例,优酷网最后轻松吞并土豆网,王微出局再创业,如同电视剧一样跌宕起伏。而这仅是公开在 表面上的故事,不为人知的暗流仍然涌动在地下世界。如果土豆网真的成功成为中国第一家上市的视频分享网站,土豆网的市值绝非后来开盘当日即惨跌12%停在 仅仅7.1亿美元的程度可比,而相应的,王微的身价也会水涨船高含金量更足,那时再来谈离婚和财产分割,获益显然比区区700万美元要可观得多。这个时 候,拦在王微和土豆网的面前,于情于理都没有任何好处。

  神州租车也曾计划在2012年启动上市,但是几乎是在消息传出的一夜之间,各大主流媒体、社交网络上都出现了关于神州租车的负面新闻,且用词相 当激烈。神州租车的董事长陆正耀后来在微博上咆哮,"没完没了的水军攻击、伪装成客户向媒体爆料,居然还买广告版面发我们的负面,我怒了!"也是出于对 "黑公关"的不堪招架。2012年4月,神州租车估值被一级级的调低,最后基本上缩水得看不到回报率,只得临时退出上市程序。

  《深圳商报》曾经有过一篇《黑心公关"猎杀"上市公司》的简单报道,揭露了一些企业在上市前夕会被人为的盯上,瞄准企业为了顺利上市而"谨小慎 微、希望顺风顺水"的心态,以胁迫的方式谋取利益,如果企业配合,"黑公关"机构就愿意顺水推舟高抬贵手,做一笔人情买卖,若是企业拒绝配合,那就会有 "从中作梗"、"故意找茬"的事件频频发生,在企业上市的步履下使绊子。

  "黑公关"一般掌握有多种形式的资源,平面及网络媒体、业界名流、水军都是常见资源,3.15等特殊时期更是有着堪称"核武器"的曝光机会,用 "翻手为云、覆手为雨"来形容并不过分。向筹划上市的商业公司进行"勒索"虽然单笔利润丰厚,但从频率上来讲却是可遇而不可求,更多的时候他们都会"自 造"机会。

  包括很多门户在内的一些网站,由于人力成本的原因,一些有着长尾价值的二级频道无法自营,便会外包给一些公司,由后者每年缴纳一定"代理费", 然后独立运作代理的频道,自负盈亏。不少"黑公关"也盯上了这块肥肉,拿下代理之后,利用该频道因为隶属门户网站而能够被百度等搜索引擎的新闻栏目爬虫索 引收录的资格,逐家的找频道主题相关的企业索要广告费用,如若遭到拒绝,就会开始不断的曝光企业负面,而中国的很多网络新闻站点又存在着"采集"这一内容 组织模式――即为了填充内容更新,网站和网站之间会互相转载新闻信息,这导致企业的负面信息会在短时间内变得极其庞杂,进而影响企业的订单、投资等收益。 这时,"黑公关"再会以另一家壳公司的名义,上门"点拨"企业,贩卖删帖生意。这就是为什么我们会从很多地方看到对删帖公司"神通广大"的渲染,其实有些 时候并不是他们有能力去"删"帖,而是帖子本身就出自他们,他们只是将帖子作为商品进行"下架"处理而已。

  当然,也有"黑公关"出过事,当一个狠人遇到比自己更狠的人时,如果察觉不到危险,一定会吃亏。360的周鸿�就 是这么一个更狠的人,故事其实业内都知道,周鸿�说你把你的老大叫上一起等我,我带钱过来,然后自己没去,叫手下带了警察过去,人赃俱获的把对方给端掉 了。但更多的企业没有这个胆识,一来在中国这个环境,没有一点小辫子存在的企业实在少之又少,二来企业本身也会顾虑能否做事做得"太绝",用钱能够解决的 问题在大多数情况下其实都不算太大的问题,如果惹怒了对方,导致用钱解决不了的报复上门,那时的摊子才更加难以收拾。

  至于一些杯弓蛇影的媒体,将"黑公关"描绘为日进斗金的暴利的产业,倒也没有那么夸张。有从业人士对我吐过苦,寻找要黑的目标其实也是一件十分 困难的事情,小的企业,它根本不在乎,你发他成百上千篇负面,可能反倒帮它做了宣传,而大点的企业,也都开始重视对法务部门的建设和投入了,万一引火烧 身,也是得不偿失。而且在中国做生意并非完全靠市场,像蒙牛这样的厂商,无论是真的出事还是被黑,它的业绩还是很好,原因很简单,它搞定了工商(政治渠 道)和货架(销售渠道),给消费者提供的是一个单选局面,又怎么会真的害怕舆论口碑呢。

  可以说,"黑公关"只是一种极端的、越界的灰色模式,它的内核精神――"强买强卖,否则就不客气"在地上互联网世界也有着文明形态的存在:做过 网站的人都知道,哪一天百度竞价排名的销售打电话上门来了,就意味着好日子的终结,如果不成为百度的付费客户,那么很快,你的网站在百度那里的收录数量将 会急剧减少,你的客户无法或者很难从百度上找到你;而当美国互联网的"门户"模式都濒临破产的时候,中国的"门户"网站仍然茁壮成长,这里面也有美国互联 网难以企及的一些因素,很多广告位在卖给企业的时候,企业投放的心态都是"花钱消灾";360和腾讯开战之前,周鸿�找腾讯,希望联合腾讯先打百度,被马 化腾拒绝,后来周鸿�就延迟做搜索到2年之后,先打了"不识抬举"的腾讯……

  "黑客"、"色情"、"黑公关"并非地下互联网世界的全部,还有一些与"炒股"、"赌博"等主题相关的产业链,也在大众视野之外很是滋润的运转 着。换句话说,只要能够保证利润的灰暗地带,都会有真菌孢子的滋生。中国媒体曾经从卡尔・马克思的《资本论》中引申出一句话,说的是"如果有100%的利 润,资本家们会挺而走险;如果有200%的利润,资本家们会藐视法律;如果有300%的利润,那么资本家们便会践踏世间的一切。"这句话本身逻辑存在硬 伤,而且其实也不是《资本论》里的原文(而是中国当年在翻译中增加的注解),但是它所指向的现象是被广泛证明了的,环境污染、食品隐患等社会矛盾的原因皆 出于此,地下互联网的存活根源也不例外。

  德国哲学先贤黑格尔在《Grundlinien der Philosophie des Rechts》中提出了"存在即合理"的辩证逻辑,所谓"合理",常被曲解为"合乎道理",实际意指的应当是"并非偶然"。在本文末尾,我想借用来解释地 下互联网世界的存在:互联网不是一个脱离现实社会的时空,恰恰相反,它由现实社会中拔根而起,同时汲取了文明的黑白两面,无论是地上、地面还是地下,生长 出来的果实都是同根同种,有一些无法公开的需求和意图,并不会凭空消失,陷到地下,自然有被满足的机会。我们没有必要上纲上线,时间的流逝、法制的完善、 科技的进化、文化的变迁会来解决这些,在那之前,不妨安然旁观,"让上帝的归上帝,让凯撒的归凯撒。"

企业不注意的30个信息安全方面细节

  小心30个细节,一分钟毁灭你的公司这是一个以1%、2%决胜负的商业时代,
一个信息就可以左右企业的成败。
这个信息在自己手里是王牌,在对手手里是炸弹。如此重要的信息,可能在老板的大脑里、公司电脑里、一个打印稿的背面,甚至在一个垃圾筐里。随时都有泄漏的可能,泄漏的结果轻则使公司蒙受损失,重则毁灭公司。
你要怎么防备?
   信息安全?"不就是安装杀毒软件,在电脑上设设密码吗"?当你这样想,你就和全世界95%的人一样,都错估、低估了信息对公司的致命影响;好在全世界就 是有5%的人,和《中国财富》一样,恐惧、震慑、急着应变于信息对商业世界爆炸性的影响力,他们是谁——诺基亚(NOKIA)、微软 (Microsoft)、麦格劳希尔(Mcgraw-Hill Company)、还有可口可乐(Coca-Cola)……
  谁是那百分之五?
  当你读这篇文章的时候,全世界又有2个企业因为信息安全问题倒闭,有11个企业因为信息安全问题造成大概800多万的直接经济损失。中国财富通过对100个经理人的调查总结30个致命细节,让您5分钟快速成为信息安全专家。
  1、打印机——10秒延迟带来信息漏洞
即使是激光打印机,也有10秒以上的延迟,如果你不在第9秒守在打印机的旁边,第一个看到文件的人可能就不是你了。大部分的现代化公司都使用公用的打印 机,并且将打印机、复印机等器材放在一个相对独立的空间里。于是,部门之间的机密文件就可以从设备室开始,在其他部门传播,当部门之间没有秘密,公司也就 没有秘密了。
  2、打印纸背面——好习惯换取的大损失
节约用纸是很多公司的好习惯,员工往往会以使用背面打印纸为荣。其实,将拥有这种习惯公司的"废纸"收集在一起,你会发现打印、复印造成的废纸所包含公司机密竟然如此全面,连执行副总都会觉得汗颜,因为废纸记载了公司里比他的工作日记都全面的内容。
  3、电脑易手——新员工真正的入职导师
我们相信,所有的职业经理人都有过这样的经历:如果自己新到一家公司工作,在自己前任的电脑里漫游是了解新公司最好的渠道。在一种近似"窥探"的状态下, 公司里曾经发生过的事情"尽收眼底",从公司以往的客户记录、奖惩制度、甚至你还有幸阅读前任的辞呈。如果是其他部门的电脑,自然也是另有一番乐趣。
  4、共享——做好文件再通知窃取者
局域网中的共享是获得公司内部机密最后的通道。有的公司为了杜绝内部网络泄密,规定所有人在共享以后一定要马上取消。实际上越是这样,企业通过共享泄露机 密的风险越大。因为当人们这样做的时候,会无所顾及地利用共享方式传播信息,人们习惯的方式是在开放式办公间的这边对着另一边的同事喊:"我放在共享里 了,你来拿吧——",没错,会有人去拿的,却往往不只是你期望的人。
  5、指数对比——聪明反被聪明误
在传统的生产型企业之间,经常要推测竞争对手的销售数量、生产数量。于是,人们为了隐藏自己的实际数量,而引入了统计学里的指数,通过对实际数量的加权, 保护自己的机密信息。唯一让人遗憾的是,通常采取的简单基期加权,如果被对方了解到几年内任何一个月的真实数量,所有的真实数量就一览无余地出现在竞争对 手的办公桌上了。
  6、培训——信息保卫战从此被动
新员工进入公司,大部分的企业会对新员工坦诚相见。从培训的第一天开始,新员工以"更快融入团队"的名义,接触公司除财务以外所有的作业部门,从公司战略 到正在采取的战术方法,从公司的核心客户到关键技术。但事实上,总有超过五分之一的员工会在入职三个月以后离开公司。同时,他们中的大部份没有离开现在从 事的行业,或许正在向你的竞争对手眉飞色舞地描述你公司的一草一木。
  7、传真机——你总是在半小时后才拿到发给你的传真
总有传真是"没有人领取"的,每周一定有人收不到重要的传真;人们总是"惊奇地"发现,自己传真纸的最后一页是别人的开头,而你的开头却怎么也找不到了。
  8、公用设备——不等于公用信息
在小型公司或者一个独立的部门里,人们经常公用U盘、软盘或手提电脑。如果有机会把U盘借给公司的新会计用,也就有可能在对方归还的时候轻易获得本月的公司损益表。
  9、摄像头——挥手之间断送的竞标机会
总部在上海的一家国内大型广告公司,在2004年3月出现的那一次信息泄露,导致竞标前一天,广告创意被竞争对手窃取,原因竟然是主创人员的OICQ上安装了视频,挥手之间,断送的或许并不仅仅是一次合作的机会。
  10、产品痕迹——靠"痕迹"了解你的未来
在市场调查领域,分析产品痕迹来推断竞争对手行销效果和行销策略是通用的方法。产品的运输、仓储、废弃的包装,都可以在竞争对手购买的调研报告中出现,因为"痕迹分析"已经是商业情报收集的常规手段。
  11、压缩软件——对信息安全威胁最大的软件
ZIP、RAR是威胁企业信息安全最大的软件。3寸软盘的存储空间是1.4M,压缩软件可以让大型的WORD文件轻松存入一张软盘,把各种资料轻松带出公司。
  12、光盘刻录——资料在备份过程中流失
如果想要拿走公司的资料,最好的办法是申请光盘备份,把文件做成特定的格式,交给网络管理员备份,然后声称不能正常打开,要求重新备份,大多情况下,留在光驱里的"废盘"就可以在下班后大大方方带出公司。
  13、邮箱——信息窃取的中转站
利用电子邮件转移窃取的公司资料占所有信息窃取的八成以上。很多企业不装软驱、光驱、USB接口,却没有办法避免员工通过电子邮件的窃取信息,相比之下,以上方法显得有些幼稚、可笑。
  14、隐藏分区——长期窃取公司资料必备手法
长期在公司内搜集资料,用来出售或保留,总是件危险的事情。自己的电脑总是不免被别人使用,发现电脑里有不该有的东西怎么行。于是隐藏在硬盘分区就成了最 佳选择,本来有C、D、E三个虚拟分区,可以把E隐藏起来,只有自己可以访问。当然,如果遇到行家,合计一下所有磁盘的总空间,可就一定露馅了。
  15、私人电脑——大量窃取资料常用手段
压缩软件的作用毕竟是有限的,如果把自己的笔记本电脑拿到单位来,连上局域网,只要半小时,就是有1个G的文件也可以轻松带走。
  16、会议记录——被忽视的公司机密
秘书往往把会议记录看得很平常,他们不知道一次高层的会议记录对于竞争对手意味着什么,公司里经常可以看见有人把会议记录当成废纸丢来丢去,任由公司最新的战略信息在企业的任何角落出现。
  17、未被采纳的策划案——放弃也是一种选择
策划人员知道被采纳的策划是公司机密,去往往不知道被放弃的策划也是公司机密。有时还会对客户或媒体谈起,而竞争对手可以轻松判断:你没有做这些,就一定选择做了那些!
  18、客户——你的机密只是盟友的谈资
经常可以在网络上看到著名咨询公司的客户提案,这些精心制作的PPT,凝聚了咨询公司团队的汗水和无数个不眠之夜,在一些信用较差的客户手里可能只是一些随意传播的谈资。
  19、招聘活动——你的公司竟然在招聘总监?
在招聘过程中,成熟的企业不会把用人的单位登在一张广告里,因为那无异于告诉你的竞争对手:刚刚发生过人力震荡,人力匮乏。
  20、招标前两分钟——最后的底价总是在最后"出炉"
如果投标的底价内部公开越早,出现泄露的风险越大,在招标开始前两分钟,面对关掉手机的参会者,可以公布底价了!
  21、解聘后半小时——不要给他最后的机会
如果被解雇的员工是今天才得到这个消息,那么,不要让他再回到他的电脑旁。半个小时的时间,刚好可以让他收拾自己的用品,和老同事做简短的告别,天下没有不散的筵席,半小时足够了,为了离职员工的清白,更为了信息安全。
  22、入职后一星期——新人在第一个星期里收集的资料是平时的5倍
只有在这一个星期里,他是随时准备离开的,他时刻处在疯狂的拷贝和传送状态,提防你的新员工,无论你多么欣赏他。
  23、合作后半个月——竞争对手窃取情报的惯用手法是:假冒客户
在初次合作的半个月里,你对信息安全的谨慎只能表明企业做事的严谨,可以赢得大部分客户的谅解和尊敬。除非,他是你的竞争对手。
  24、离职后30天——危险来自公司以外
一般情况下,一个为企业服务半年以上的员工,离职后30日之内会和公司现有员工保持频繁的联系,并且对公司的资料和状况表现出极度的热情。如果是被限时离开,那么,在离职30天内通过老同事窃取公司信息的可能性就更大。
  25、明确对外提案原则——能不留东西的就不给打印稿
能不给电子档的就尽量给打印稿,能用电子书就不用通用格式。
  26、保密协议——无论作用大小,和员工签定清晰的保密协议还是必要的
无规矩不成方圆,明确什么是对的,人们才可以杜绝错的。保密协议的内容越详细越好,如果对方心胸坦白,自然会欣然同意。
  27、责任分解——明确每个人对相关信息的安全责任
所有的机密文件如果出现泄露,可以根据规定找到责任人,追究是次要的,相互监督和防范才是责任分解的最终目的。
  28、设立信息级别——对公司的机密文件进行级别划分
比如合同、客户交往、股东情况列为一级,确定机密传播的范围,让所有人了解信息的传播界限,避免因为对信息的不了解而导致的信息安全事故。
  29、异地保存——别把鸡蛋放在同一个篮子里

所有备份资料尽量做到异地保存,避免因为重大事故(如:火灾、地震、战争等)对企业信息带来致命的打击。

 30、认为自己的企业在信息安全上无懈可击。

 

2013年4月23日星期二

Best Paper Awards in Computer Science (since 1996)

Best Paper Awards in Computer Science (since 1996)

By Conference:   AAAI   ACL   CHI   CIKM   CVPR   FOCS   FSE   ICCV   ICML   ICSE   IJCAI   INFOCOM   KDD   MOBICOM   NSDI   OSDI   PLDI   PODS   S&P   SIGCOMM   SIGIR  SIGMETRICS   SIGMOD   SODA   SOSP   STOC   UIST   VLDB   WWW

Institutions with the most Best Papers

Much of this data was entered by hand (obtained by contacting past conference organizers, retrieving cached conference websites, and searching CVs) so please email me if you notice any errors or omissions: bestpaper-AT-jeffhuang.com. I tried to collect best paper awards from the top-tier conferences in each area, but some conferences do not have such an award (e.g. SIGGRAPH, CAV). "Distinguished paper award" and "outstanding paper award" are included but not "best student paper" (e.g. NIPS) or "best 10-year old paper" (e.g. POPL)


AAAI (Artificial Intelligence)
2012Document Summarization Based on Data Reconstruction Zhanying He, Zhejiang University; et al.
Learning SVM Classiiers with Indeinite Kernels Suicheng Gu & Yuhong Guo, Temple University
2011 Dynamic Resource Allocation in Conservation Planning Daniel Golovin, California Institute of Technology; et al.
Complexity of and Algorithms for Borda Manipulation Jessica Davies, University of Toronto; et al.
2010How Incomplete Is Your Semantic Web Reasoner? Systematic Analysis of the Completeness of Query Ans... Giorgos Stoilos, Oxford University; et al.
A Novel Transition Based Encoding Scheme for Planning as Satisfiability Ruoyun Huang, Washington University in St. Louis; et al.
2008How Good is Almost Perfect? Malte Helmert & Gabriele Röger, Albert-Ludwigs-Universität Freiburg
Optimal False-Name-Proof Voting Rules with Costly Voting Liad Wagman & Vincent Conitzer, Duke University
2007 PLOW: A Collaborative Task Learning Agent James Allen, Institute for Human and Machine Cognition; et al.
Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games Colin McMillen & Manuela Veloso, Carnegie Mellon University
2006 Model Counting: A New Strategy for Obtaining Good Bounds Carla P. Gomes, Cornell University; et al.
Towards an Axiom System for Default Logic Gerhard Lakemeyer, RWTH Aachen University
Hector J. Levesque, University of Toronto
2005The Max K- Armed Bandit: A New Model of Exploration Applied to Search Heuristic Selection Vincent A. Cicirello, Drexel University
Stephen F. Smith, Carnegie Mellon University
2004Learning and Inferring Transportation Routines Lin Liao, University of Washington; et al.
2002On Computing All Abductive Explanations Thomas Eiter, Technische Universität Wien
Kazuhisa Makino, Osaka University
2000The Game of Hex: An Automatic Theorem-Proving Approach to Game Programming Vadim V. Anshelevich, Vanshel Consulting
1999 PROVERB: The Probabilistic Cruciverbalist Greg A. Keim, Duke University; et al.
1998Learning Evaluation Functions for Global Optimization and Boolean Satisfiability Justin A. Boyan & Andrew W. Moore, Carnegie Mellon University
Acceleration Methods for Numeric CSPs Yahia Lebbah & Olivier Lhomme, Ecole des Mines de Nantes
The Interactive Museum Tour-Guide Robot Wolfram Burgard, University of Bonn; et al.
1997Statistical Parsing with a Context-Free Grammar and Word Statistics Eugene Charniak, Brown University
A Practical Algorithm for Finding Optimal Triangulations Krill Shoikhet & Dan Geiger, Technion
Fast Context Switching in Real-Time Propositional Reasoning P. Pandurang Nayak & Brian C. Williams, NASA Ames Research Center
Building Concept Representations from Reusable Components Peter Clark, Boeing
Bruce Porter, University of Texas at Austin
1996 Verification of Knowledge Bases Based on Containment Checking Alon Y. Levy, AT&T Laboratories
Marie-Christine Rousset, Université Paris-Sud
A Novel Application of Theory Refinement to Student Modeling Paul T. Baffes, SciComp
Raymond J. Mooney, University of Texas at Austin
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search Henry Kautz & Bart Selman, AT&T Laboratories
ACL (Natural Language Processing)
2012 String Re-writing Kernel Fan Bu, Tsinghua University; et al.
Bayesian Symbol-Refined Tree Substitution Grammars for Syntactic Parsing Hiroyuki Shindo, NTT Communication Science Laboratories; et al.
2011Unsupervised Part-of-Speech Tagging with Bilingual Graph-Based Projections Dipanjan Das, Carnegie Mellon University
Slav Petrov, Google
2010 Beyond NomBank: A Study of Implicit Arguments for Nominal Predicates Matthew Gerber & Joyce Y. Chai, Michigan State University
2009 Reinforcement Learning for Mapping Instructions to Actions S.R.K. Branavan, Massachusetts Institute of Technology; et al.
K-Best A* Parsing Adam Pauls & Dan Klein, University of California Berkeley
Concise Integer Linear Programming Formulations for Dependency Parsing André F.T. Martins, Instituto de Telecomunicações; et al.
2008Forest Reranking: Discriminative Parsing with Non-Local Features Liang Huang, University of Pennsylvania
A New String-to-Dependency Machine Translation Algorithm with a Target Dependency Language Model Libin Shen, BBN Technologies; et al.
2007Learning synchronous grammars for semantic parsing with lambda calculus Yuk Wah Wong & Raymond J. Mooney, University of Texas at Austin
2006 Semantic taxonomy induction from heterogenous evidence Rion Snow, Stanford University; et al.
2005A Hierarchical Phrase-Based Model for Statistical Machine Translation David Chiang, University of Maryland
2004 Finding Predominant Word Senses in Untagged Text Diana McCarthy, University of Sussex; et al.
2003Accurate Unlexicalized Parsing Dan Klein & Christopher D. Manning, Stanford University
Towards a Model of Face-to-Face Grounding Yukiko I. Nakano, RISTEX; et al.
2002Discriminative Training and Maximum Entropy Models for Statistical Machine Translation Franz Josef Och & Hermann Ney, RWTH Aachen University
2001 Immediate-Head Parsing for Language Models Eugene Charniak, Brown University
Fast Decoding and Optimal Decoding for Machine Translation Ulrich Germann, University of Southern California; et al.
CHI (Human-Computer Interaction)
2013Labor Dynamics in a Mobile Micro-Task Market Mohamed Musthag & Deepak Ganesan, University of Massachusetts Amherst
What is "Critical" About Critical Design? Jeffrey Bardzell & Shaowen Bardzell, Indiana University at Bloomington
SPRWeb: Preserving Subjective Responses to Website Colour Schemes through Automatic Recolouring David R. Flatla, University of Saskatchewan; et al.
LaserOrigami: Laser-Cutting 3D Objects Stefanie Mueller, Hasso Plattner Institute; et al.
Mind the Theoretical Gap: Interpreting, Using, and Developing Behavioral Theory in HCI Research Eric B. Hekler, Arizona State University; et al.
Screenfinity: Extending the Perception Area of Content on Very Large Public Displays Constantin Schmidt, Technische Universität Berlin; et al.
Reasons to Question Seven Segment Displays Harold Thimbleby, Swansea University
Improving Navigation-Based File Retrieval Stephen Fitchett, University of Canterbury; et al.
The Dubuque Electricity Portal: Evaluation of a City-Scale Residential Electricity Consumption Fee... Tom Erickson, IBM Research; et al.
At Home with Agents: Exploring Attitudes Towards Future Smart Energy Infrastructures Tom Rodden, University of Nottingham; et al.
Job Opportunities through Entertainment: Virally Spread Speech-Based Services for Low-Literate Users Agha Ali Raza, Carnegie Mellon University; et al.
IllumiRoom: Peripheral Projected Illusions for Interactive Experiences Brett Jones, University of Illinois at Urbana-Champaign; et al.
The Efficacy of Human Post-Editing for Language Translation Spence Green, Stanford University; et al.
Analyzing User-Generated YouTube Videos to Understand Touchscreen Use by People with Motor Impairm... Lisa Anthony, University of Maryland Baltimore County; et al.
Turkopticon: Interrupting Worker Invisibility in Amazon Mechanical Turk Lilly Irani, University of California Irvine
M. Six Silberman, Bureau of Economic Interpretation
Webzeitgeist: Design Mining the Web Ranjitha Kumar, Stanford University; et al.
Weighted Graph Comparison Techniques for Brain Connectivity Analysis Basak Alper, University of California Santa Barbara; et al.
The Many Faces of Facebook: Experiencing Social Media as Performance, Exhibition, and Personal Arc... Xuan Zhao, Cornell University; et al.
2012Uncomfortable Interactions Steve Benford, University of Nottingham; et al.
ClayVision: The (Elastic) Image of the City Yuichiro Takeuchi, Sony Computer Science Laboratories
Ken Perlin, New York University
Revisiting the Jacquard Loom: Threads of History and Current Patterns in HCI Ylva Fernaeus, KTH Royal Institute of Technology; et al.
Personas and Decision Making in the Design Process: An Ethnographic Case Study Erin Friess, University of North Texas
Detecting Error-Related Negativity for Interaction Design Chi Vi & Sriram Subramanian, University of Bristol
Observational and Experimental Investigation of Typing Behaviour using Virtual Keyboards for Mobil... Niels Henze, University of Oldenburg; et al.
Looking Glass: A Field Study on Noticing Interactivity of Shop Windows Jörg Müller, Technische Universität Berlin; et al.
Touché: Enhancing Touch Interaction on Humans, Screens, Liquids, and Everyday Objects Munehiko Sato, Disney Research; et al.
Affordances in HCI: Toward a Mediated Action Perspective Victor Kaptelinin, University of Bergen
Bonnie Nardi, University of California Irvine
Using Rhythmic Patterns as an Input Method Emilien Ghomi, Université Paris-Sud; et al.
The Normal Natural Troubles of Driving with GPS Barry Brown, Stockholm University
Eric Laurier, University of Edinburgh
Communitysourcing: Engaging Local Crowds to Perform Expert Work Via Physical Kiosks Kurtis Heimerl, University of California Berkeley; et al.
Improving Command Selection with CommandMaps Joey Scarr, University of Canterbury; et al.
Empathy, Participatory Design and People with Dementia Stephen Lindsay, Newcastle University; et al.
2011Usable Gestures for Blind People: Understanding Preference and Performance Shaun K. Kane, University of Washington; et al.
Effects of Community Size and Contact Rate in Synchronous Social Q&A Ryen W. White, Microsoft Research; et al.
Teenagers and Their Virtual Possessions: Design Opportunities and Issues William Odom, Carnegie Mellon University; et al.
Enhancing Physicality in Touch Interaction with Programmable Friction Vincent Levesque, University of British Columbia; et al.
Mid-air Pan-and-Zoom on Wall-sized Displays Mathieu Nancel, Université Paris-Sud; et al.
Bricolage: Example-Based Retargeting for Web Design Ranjitha Kumar, Stanford University; et al.
Synchronous Interaction Among Hundreds: An Evaluation of a Conference in an Avatar-based Virtual E... Thomas Erickson, IBM Research; et al.
In the Shadow of Misperception: Assistive Technology Use and Social Interactions Kristen Shinohara & Jacob O. Wobbrock, University of Washington
Why is My Internet Slow?: Making Network Speeds Visible Marshini Chetty, Georgia Institute of Technology; et al.
Ease of Juggling: Studying the Effects of Manual Multitasking Antti Oulasvirta & Joanna Bergstrom-Lehtovirta, Aalto University
Automics: souvenir generating photoware for theme parks Abigail Durrant, University of Nottingham; et al.
Your Noise is My Command: Sensing Gestures Using the Body as an Antenna Gabe Cohn, University of Washington; et al.
Review Spotlight: A User Interface for Summarizing User-generated Reviews Using Adjective-Noun Wor... Koji Yatani, University of Toronto; et al.
2010Lumino: Tangible Blocks for Tabletop Computers Based on Glass Fiber Bundles Patrick Baudisch, Hasso Plattner Institute; et al.
Mapping the Landscape of Sustainable HCI Carl DiSalvo, Georgia Institute of Technology; et al.
Occlusion-Aware Interfaces Daniel Vogel & Ravin Balakrishnan, University of Toronto
Avaaj Otalo — A Field Study of an Interactive Voice Forum for Small Farmers in Rural India Neil Patel, Stanford University; et al.
How does search behavior change as search becomes more difficult? Anne Aula, Google; et al.
The Tower of Babel Meets Web 2.0: User-Generated Content and its Applications in a Multilingual Co... Brent Hecht & Darren Gergle, Northwestern University
Skinput: Appropriating the Body as an Input Surface Chris Harrison, Carnegie Mellon University; et al.
Mobile-izing Health Workers in Rural India Divya Ramachandran, University of California Berkeley; et al.
The Design of Eco-Feedback Technology Jon Froehlich, University of Washington; et al.
Feminist HCI: Taking Stock and Outlining an Agenda for Design Shaowen Bardzell, Indiana University at Bloomington
Prefab: Implementing Advanced Behaviors Using Pixel-Based Reverse Engineering of Interface Structure Morgan Dixon & James Fogarty, University of Washington
Useful Junk? The Effects of Visual Embellishment on Comprehension and Memorability of Charts Scott Bateman, University of Saskatchewan; et al.
2009From Interaction to Trajectories: Designing Coherent Journeys Through User Experiences Steve Benford, University of Nottingham; et al.
Sizing the Horizon: The Effects of Chart Size and Layering on the Graphical Perception of Time Ser... Jeffrey Heer, Stanford University; et al.
Predicting Tie Strength With Social Media Eric Gilbert & Karrie Karahalios, University of Illinois at Urbana-Champaign
Musink: Composing Music through Augmented Drawing Theophanis Tsandilas, Université Paris-Sud; et al.
Social Immersive Media: Pursuing Best Practices for Multi-user Interactive Camera/Projector Exhibits Scott S. Snibbe, Sona Research
Hayes S. Raffle, Massachusetts Institute of Technology
Ephemeral Adaptation: The Use of Gradual Onset to Improve Menu Selection Performance Leah Findlater, University of British Columbia; et al.
Undo and Erase Events as Indicators of Usability Problems David Akers, Stanford University; et al.
2008In-Car GPS Navigation: Engagement with and Disengagement from the Environment Gilly Leshed, Cornell University; et al.
Improving the Performance of Motor-Impaired Users with Automatically-Generated, Ability-Based Inte... Krzysztof Z. Gajos, University of Washington; et al.
Large Scale Analysis of Web Revisitation Patterns Eytan Adar, University of Washington; et al.
Designs on Dignity: Perceptions of Technology Among the Homeless Christopher A. Le Dantec & W. Keith Edwards, Georgia Institute of Technology
The Network in the Garden: An Empirical Analysis of Social Media in Rural Life Eric Gilbert, University of Illinois at Urbana-Champaign; et al.
Multimodal collaborative handwriting training for visually-impaired people Beryl Plimmer, University of Auckland; et al.
An Error Model for Pointing Based on Fitts' Law Jacob O. Wobbrock, University of Washington; et al.
2007Multiview: improving trust in group video conferencing through spatial faithfulness David T. Nguyen & John Canny, University of California Berkeley
Software or wetware?: discovering when and why people use digital prosthetic memory Vaiva Kalnikaité & Steve Whittaker, University of Sheffield
Shift: a technique for operating pen-based interfaces using touch Daniel Vogel, University of Toronto
Patrick Baudisch, Microsoft Research
Authoring sensor-based interactions by demonstration with direct manipulation and pattern recognit... Björn Hartmann, Stanford University; et al.
Sustainable interaction design: invention & disposal, renewal & reuse Eli Blevis, Indiana University at Bloomington
Consuming video on Mobile devices Kenton O'Hara, Hewlett-Packard Labs; et al.
2006Trackball text entry for people with motor impairments Jacob O. Wobbrock & Brad Myers, Carnegie Mellon University
Embedded phenomena: supporting science learning with classroom-sized distributed simulations Tom Moher, University of Illinois at Chicago
A role for haptics in mobile interaction: initial design using a handheld tactile display prototype Joseph Luk, University of British Columbia; et al.
2005Making space for stories: ambiguity in the design of personal communication systems Paul M. Aoki, Palo Alto Research Center
Allison Woodruff, Intel Research
Examining Task Engagement in Sensor-Based Statistical Models of Human Interruptibility James Fogarty, Carnegie Mellon University; et al.
Designing the spectator experience Stuart Reeves, University of Nottingham; et al.
The bubble cursor: enhancing target acquisition by dynamic resizing of the cursor's activation area Tovi Grossman & Ravin Balakrishnan, University of Toronto
CIKM (Knowledge Management)
2012 Gelling, and Melting, Large Graphs by Edge Manipulation Hanghang Tong, IBM Research; et al.
2011Intent-aware query similarity Jiafeng Guo, Chinese Academy of Sciences; et al.
2010MENTA: Inducing Multilingual Taxonomies from Wikipedia Gerard de Melo & Gerhard Weikum, Max Planck Institut
FACeTOR: cost-driven exploration of faceted query results Abhijith Kashyap, State University of New York at Buffalo; et al.
2009On the Feasibility of Multi-Site Web Search Engines Ricardo Baeza-Yates, Yahoo! Research; et al.
2008Learning to Link with Wikipedia David Milne & Ian H. Witten, Univerisity of Waikato
2007 Autonomously Semantifying Wikipedia Fei Wu & Daniel S. Weld, University of Washington
2006 Discovering and Exploiting Keyword and Attribute-Value Co-occurrences to Improve P2P Routing Indices Segabtian Michel, Max Planck Institut; et al.
2005Towards Automatic Association of Relevant Unstructured Content with Structured Query Results Prasan Roy, IBM Research; et al.
2004Discovering Frequently Changing Structures from Historical Structural Deltas of Unordered XML Qiankun Zhao, Nanyang Technological University; et al.
CVPR (Computer Vision)
2012A Simple Prior-free Method for Non-Rigid Structure-from-Motion Factorization Yuchao Dai, Northwestern Polytechnical University; et al.
2011Real-time Human Pose Recognition in Parts from Single Depth Images Jamie Shotton, Microsoft Research; et al.
2010Efficient Computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data usi... Anders Eriksson & Anton va den Hendel, University of Adelaide
2009 Single Image Haze Removal Using Dark Channel Prior Kaiming He, The Chinese University of Hong Kong; et al.
2008Global Stereo Reconstruction under Second Order Smoothness Priors Oliver Woodford, University of Oxford; et al.
Beyond Sliding Windows: Object Localization by Efficient Subwindow Search Chistoph H. Lampert, Max Planck Institut; et al.
2007Dynamic 3D Scene Analysis from a Moving Vehicle Bastian Leibe, ETH Zurich; et al.
2006Putting Objects in Perspective Derek Hoiem, Carnegie Mellon University; et al.
2005Real-Time Non-Rigid Surface Detection Julien Pilet, École Polytechnique Fédérale de Lausanne; et al.
2004Programmable Imaging using a Digital Micromirror Array Shree K. Nayar, Columbia University; et al.
2003Object Class Recognition by Unsupervised Scale-Invariant Learning Rob Fergus, University of Oxford; et al.
2001Morphable 3D models from video Matthew Brand, Mitsubishi Electric Research Laboratories
2000 Real-Time Tracking of Non-Rigid Objects using Mean Shift Dorin Comaniciu, Siemens Corporate Research; et al.
FOCS (Theory)
2012A multi-prover interactive proof for NEXP sound against entangled provers Tsuyoshi Ito, NEC Labs America
Thomas Vidick, Massachusetts Institute of Technology
A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 Julia Chuzhoy, Toyota Technological Institute at Chicago
Shi Li, Princeton University
2011A Randomized Rounding Approach to the Traveling Salesman Problem Shayan Oveis Gharan, Stanford University; et al.
A Polylogarithmic-Competitive Algorithm for the k-Server Problem Nikhil Bansal, IBM Research; et al.
Approximating Graphic TSP by Matchings Tobia M¨o;mke & Ola Svensson, Royal Institute of Technology
2010 Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions Matthew Andrews, Bell Labs
Subexponential Algorithms for Unique Games and Related Problems Sanjeev Arora, Princeton University; et al.
Computational Transition at the Uniqueness Threshold Allan Sly, Microsoft Research
2008 Two Query PCP with Sub-Constant Error Dana Moshkovitz & Ran Raz, Weizmann Institute of Science
2007 Space-Efficient Identity Based Encryption Without Pairings Dan Boneh, Stanford University; et al.
2006Settling the Complexity of 2-Player Nash Equilibrium Xi Chen, Tsinghua University
Xiaotie Deng, City University of Hong Kong
2005The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type M... Subhash A. Khot, Georgia Institute of Technology
Nisheeth K. Vishnoi, IBM Research
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time Farzad Parvaresh & Alexander Vardy, University of California San Diego
2004Cryptography in NC0 Benny Applebaum, Technion; et al.
Hardness of Approximating the Shortest Vector Problem in Lattices Subhash Khot, Georgia Institute of Technology
2003 On the Impossibility of Dimension Reduction in L1 Bo Brinkman & Moses Charikar, Princeton University
2002 A Dichotomy Theorem for Constraints on a Three-Element Set Andrei A. Bulatov, University of Oxford
Minimizing Congestion in General Networks Harald Räcke, Paderborn University
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model Boaz Barak, Weizmann Institute of Science
FSE (Software Engineering)
2012 Seeking the Ground Truth: A Retroactive Study on the Evolution and Migration of Software Libraries Bradley Cossette & Robert Walker, University of Calgary
Scalable Test Data Generation from Multidimensional Models Emina Torlak, University of California Berkeley
Assessing the Value of Branches with What-if Analysis Christian Bird & Thomas Zimmermann, Microsoft Research
2011 Proactive Detection of Collaboration Conflicts Yuriy Brun, University of Washington; et al.
How Do Fixes Become Bugs? Zuoning Yin, University of Illinois at Urbana-Champaign; et al.
Proving programs robust Swarat Chaudhuri, Rice University; et al.
2010Creating and evolving developer documentation: understanding the decisions of open source contribu... Barthélémy Dagenais & Martin P. Robillard, McGill University
Developer Fluency: Achieving True Mastery in Software Projects Minghui Zhou, Peking University
Audris Mockus, Avaya Labs
Staged Concurrent Program Analysis Nishant Sinha & Chao Wang, NEC Labs America
2009 Asserting and checking determinism for multithreaded programs Jacob Burnim & Koushik Sen, University of California Berkeley
Darwin: an approach for debugging evolving programs Dawei Qi, National University of Singapore; et al.
Graph-based Mining of Multiple Object Usage Patterns Tung Thanh Nguyen, Iowa State University; et al.
2008What makes a good bug report? Nicolas Bettenburg, Saarland University; et al.
Efficient online monitoring of web-service SLAs Franco Raimondi, University College London; et al.
2007Automatic consistency assessment for query results in dynamic environments Jamie Payton, University of North Carolina at Charlotte; et al.
Globally distributed software development project performance: an empirical analysis Narayan Ramasubbu & Rajesh Krishna Balan, Singapore Management University
Mining specifications of malicious behavior Mihai Christodorescu, University of Wisconsin; et al.
Object and reference immutability using Java generics Yoav Zibin, Massachusetts Institute of Technology; et al.
2006Controlling factors in evaluating path-sensitive error detection techniques Matthew B. Dwyer, University of Nebraska-Lincoln; et al.
SYNERGY: a new algorithm for property checking Bhargav S. Gulavani, Indian Institute of Technology; et al.
2005Automatic Generation of Suggestions for Program Investigation Martin P. Robillard, McGill University
CUTE: a concolic unit testing engine for C Koushik Sen, University of Illinois at Urbana-Champaign; et al.
Context- and path-sensitive memory leak detection Yichen Xie & Alex Aiken, Stanford University
2004 Reasoning about partial goal satisfaction for requirements and design engineering Emmanuel Letier & Axel van Lamsweerde, Université catholique de Louvain
A classification system and analysis for aspect-oriented programs Martin Rinard, Massachusetts Institute of Technology; et al.
2003Eliminating redundancies with a "composition with adaptation" meta-programming technique Stan Jarzabek, National University of Singapore
Li Shubiao, Xi'an Jiaotong University
A Family of Test Adequacy Criteria for Database-Driven Applications Gregory M. Kapfhammer & Mary Lou Soffa, University of Pittsburgh
Predicting problems caused by component upgrades Stephen McCamant & Michael D. Ernst, Massachusetts Institute of Technology
2002Isolating Cause-Effect Chains from Computer Programs Andreas Zeller, Saarland University
ICCV (Computer Vision)
2011 Relative Attributes Devi Parikh, Toyota Technological Institute at Chicago
Kristen Grauman, University of Texas at Austin
2009Discriminative models for multi-class object layout Chaitanya Desai, University of California Irvine; et al.
2007Population Shape Regression From Random Design Data Bradley Davis, University of North Carolina at Chapel Hill; et al.
2005Globally Optimal Estimates for Geometric Reconstruction Problems Fredrik Kahl, Lund University
Didier Henrion, LAAS-CNRS
2003 Detecting Pedestrians using Patterns of Motion and Appearance Paul Viola, Microsoft Research; et al.
Image Parsing: Unifying Segmentation, Detection and Recognition Zhuowen Tu, University of California Los Angeles; et al.
Image-based Rendering using Image-based Priors Andrew Fitzgibbon, University of Oxford; et al.
2001Probabilistic Tracking with Exemplars in a Metric Space Kentaro Toyama & Andrew Blake, Microsoft Research
The Space of All Stereo Images Steven Seitz, University of Washington
1999 Euclidean Reconstruction and Reprojection up to Subgroups Yi Ma, University of California Berkeley; et al.
A Theory of Shape by Space Carving Kiriakos Kutulakos, University of Rochester
Steven Seitz, Carnegie Mellon University
1998Self-Calibration and Metric Reconstruction in spite of Varying and Unknown Internal Camera Paramet... Marc Pollefeys, Katholieke Universiteit Leuven; et al.
The Problem of Degeneracy in Structure and Motion Recovery from Uncalibrated Image Sequences Phil Torr, Microsoft Research; et al.
ICML (Machine Learning)
2012 Bayesian Posterior Sampling via Stochastic Gradient Fisher Scoring Sungjin Ahn, University of California Irvine; et al.
2011Computational Rationalization: The Inverse Equilibrium Problem Kevin Waugh, Carnegie Mellon University; et al.
2010Hilbert Space Embeddings of Hidden Markov Models Le Song, Carnegie Mellon University; et al.
2009Structure preserving embedding Blake Shaw & Tony Jebara, Columbia University
2008 SVM Optimization: Inverse Dependence on Training Set Size Shai Shalev-Shwartz & Nathan Srebro, Toyota Technological Institute at Chicago
2007Information-theoretic metric learning Jason V. Davis, University of Texas at Austin; et al.
2006Trading convexity for scalability Ronan Collobert, NEC Labs America; et al.
2005A support vector method for multivariate performance measures Thorsten Joachims, Cornell University
1999 Least-Squares Temporal Difference Learning Justin A. Boyan, NASA Ames Research Center
ICSE (Software Engineering)
2012 Understanding Integer Overflow in C/C++ Will Dietz, University of Illinois at Urbana-Champaign; et al.
Using Dynamic Analysis to Discover Polynomial and Array Invariants ThanhVu Nguyen, University of New Mexico; et al.
Amplifying Tests to Validate Exception Handling Code Pingyu Zhang & Sebastian Elbaum, University of Nebraska-Lincoln
Partial Models: Towards Modeling and Reasoning with Uncertainty Michalis Famelis, University of Toronto; et al.
How Do Professional Developers Comprehend Software? Tobias Roehm, Technische Universität München; et al.
A Tactic-Centric Approach for Automating Traceability of Quality Concerns Mehdi Mirakhorli, DePaul University; et al.
Automated Detection of Client-State Manipulation Vulnerabilities Anders Møller & Mathias Schwarz, Aarhus University
2011 Verifying Multi-threaded Software using SMT-based Context-Bounded Model Checking Lucas Cordeiro & Bernd Fischer, University of Southampton
Configuring Global Software Teams: A Multi-Company Analysis of Project Productivity, Quality, and ... Narayan Ramasubbu, Singapore Management University; et al.
Programs, tests, and oracles: the foundations of testing revisited Matt Staats, University of Minnesota; et al.
On-demand Feature Recommendations Derived from Mining Public Product Descriptions Horatiu Dumitru, DePaul University; et al.
Run-Time Efficient Probabilistic Model Checking Antonio Filieri, Politecnico di Milano; et al.
2010A Machine Learning Approach for Tracing Regulatory Codes to Product Specific Requirements Jane Cleland-Huang, DePaul University; et al.
Collaborative Reliability Prediction of Service-Oriented Systems Zibin Zheng & Michael R. Lyu, The Chinese University of Hong Kong
A Cut-off Approach for Bounded Verification of Parameterized Systems Qiusong Yang & Mingshu Li, Chinese Academy of Sciences
Test Generation through Programming in UDITA Milos Gligoric, University of Illinois at Urbana-Champaign; et al.
A Degree-of-Knowledge Model to Capture Source Code Familiarity Thomas Fritz, University of British Columbia; et al.
2009How We Refactor, and How We Know It Emerson Murphy-Hill, Portland State University; et al.
Effective Static Deadlock Detection Mayur Naik, Intel Research; et al.
Invariant-Based Automatic Testing of AJAX User Interfaces Ali Mesbah & Arie van Deursen, Delft University of Technology
Does Distributed Development Affect Software Quality? An Empirical Case Study of Windows Vista Christian Bird, University of California Davis; et al.
Automatically finding patches using genetic programming Westley Weimer, University of Virginia; et al.
2008Precise memory leak detection for java software using container profiling Guoqing Xu & Atanas Rountev, Ohio State University
Debugging reinvented: asking and answering why and why not questions about program behavior Andrew J. Ko & Brad A. Myers, Carnegie Mellon University
Recommending adaptive changes for framework evolution Barthélémy Dagenais & Martin P. Robillard, McGill University
Predicting Accurate and Actionable Static Analysis Warnings: An Experimental Approach Joseph Ruthruff, University of Nebraska-Lincoln; et al.
The effect of program and model structure on mc/dc test adequacy coverage Ajitha Rajan, University of Minnesota; et al.
2007Refactoring for Parameterizing Java Classes Adam Kiezun, Massachusetts Institute of Technology; et al.
Tracking Code Clones in Evolving Software Ekwa Duala-Ekoko & Martin P. Robillard, McGill University
Matching and Merging of Statecharts Specifications Shiva Nejati, University of Toronto; et al.
Predicting Faults from Cached History Sunghun Kim, Massachusetts Institute of Technology; et al.
2006Model-Based Development of Dynamically Adaptive Software Ji Zhang & Betty H.C. Cheng, Michigan State University
Who Should Fix This Bug? John Anvik, University of British Columbia; et al.
2005Eliciting Design Requirements for Maintenance-Oriented IDEs: A Detailed Study of Corrective and Pe... Andrew Ko, Carnegie Mellon University; et al.
Is Mutation an Appropriate Tool for Testing Experiments? James Andrews, University of Western Ontario; et al.
Using Structural Context to Recommend Source Code Examples Reid Holmes & Gail Murphy, University of British Columbia
Data Structure Repair Using Goal-Directed Reasoning Brian Demsky & Martin Rinard, Massachusetts Institute of Technology
2004SNIAFL: Towards a Static Non-Interactive Approach to Feature Location Wei Zhao, Peking University; et al.
Extending the REpresentational State Transfer (REST) Architectural Style for Decentralized Systems Rohit Khare & Richard N. Taylor, University of California Irvine
An Empirical Study of Software Reuse vs. Defect-Density and Stability Parastoo Mohagheghi, Ericsson; et al.
A Tool for Writing and Debugging Algebraic Specifications Johannes Henkel & Amer Diwan, University of Colorado
Static Checking of Dynamically Generated Queries in Database Applications Carl Gould, University of California Davis; et al.
2003Precise Dynamic Slicing Algorithms Xiangyu Zhang, University of Arizona; et al.
Modular Verification of Software Components in C Sagar Chaki, Carnegie Mellon University; et al.
IJCAI (Artificial Intelligence)
2011Unweighted Coalitional Manipulation Under the Borda Rule is NP-Hard Nadja Betzler, Technische Universität Berlin; et al.
Nested Rollout Policy Adaptation for Monte Carlo Tree Search Christopher D. Rosin, Parity Computing
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces Roman Kontchakov, Birkbeck College London; et al.
2009Consequence-Driven Reasoning for Horn SHIQ Ontologies Yevgeny Kazakov, University of Oxford
Learning Conditional Preference Networks with Queries Frederic Koriche, Université Montpellier II
Bruno Zanuttini, Université de Caen Basse-Normandie
2007Automated Heart Wall Motion Abnormality Detection From Ultrasound Images using Bayesian Networks Maleeha Qazi, Siemens Medical Solutions; et al.
Building Structure into Local Search for SAT Duc Nghia Pham, Griffith University; et al.
Performance Analysis of Online Anticipatory Algorithms for Large Multistage Stochastic Integer Pro... Luc Mercier & Pascal Van Hentenryck, Brown University
2005 Learning Coordination Classifiers Yuhong Guo, University of Alberta; et al.
Solving Checkers Jonathan Schaeffer, University of Alberta; et al.
A Probabilistic Model of Redundancy in Information Extraction Doug Downey, University of Washington; et al.
2003Approximating Game-Theoretic Optimal Strategies for Full-scale Poker Darse Billings, University of Alberta; et al.
Thin Junction Tree Filters for Simultaneous Localization and Mapping Mark A. Paskin, University of California Berkeley
2001 Complexity Results for Structure-Based Causality Thomas Eiter & Thomas Lukasiewicz, Vienna University of Technology
1999 Learning in Natural Language Dan Roth, University of Illinois at Urbana-Champaign
A Distributed Case-Based Reasoning Application for Engineering Sales Support Ian Watson, University of Salford
Dan Gardingen, Western Air
1997 Object Identification in a Bayesian Context Timothy Huang & Stuart Russell, University of California Berkeley
Translingual Information Retrieval: A Comparative Evaluation Jaime G. Carbonell, Carnegie Mellon University; et al.
Applications of the Situation Calculus to Formalizing Control and Strategic Information: The Prolo... Fangzhen Lin, The Hongkong University of Science and Technology
INFOCOM (Networking)
2012 Multi-resource allocation: Fairness-efficiency tradeoffs in a unifying framework Carlee Joe-Wong, Princeton University; et al.
2011Dynamic right-sizing for power-proportional data centers Minghong Lin, California Institute of Technology; et al.
2010On the Feasibility and Efficacy of Protection Routing in IP Networks Kin-Wah Kwong, University of Pennsylvania; et al.
2009Queuing Network Models for Multi-Channel P2P Live Streaming Systems Di Wu, Polytechnic Institute of New York University; et al.
2008On the Feasibility of the Link Abstraction in (Rural) Mesh Networks Dattatraya Gokhal, Indian Navy; et al.
Theoretical Results on Base Station Movement Problem for Sensor Networks Yi Shi & Y. Thomas Hou, Virginia Tech
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-hop Wireless... Changhee Joo, Ohio State University; et al.
2007Disruption free topology reconfiguration in OSPF networks Pierre Francois, Université catholique de Louvain; et al.
2006Delay and Capacity Trade-offs in Mobile Ad Hoc Networks: A Global Perspective Gaurav Sharma, Purdue University; et al.
2005Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boude, École Polytechnique Fédérale de Lausanne
Milan Vojnović, Microsoft Research
2004Throughput-Delay Trade-Off in Wireless Networks Abbas El Gamal, Stanford University; et al.
2003User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks Sem Borst, Bell Labs
2002 Priority Service and Max-Min Fairness Peter Marbach, University of Toronto
2001 Mobility increases the capacity of ad-hoc wireless networks Matthias Grossglauser, AT&T Laboratories
David Tse, University of California Berkeley
2000The Chaotic Nature of TCP Congestion Control András Veres, Ericsson
Miklós Boda, Ericsson Research
1999 Bandwidth Sharing: Objectives and Algorithms Laurent Massoulié, Microsoft Research
James Robert, France Télécom R&D
1998Effective Bandwidths in Wireless Networks with Multiuser Receivers David Tse, University of California Berkeley
Stephen Hanly, University of Melbourne
1996An algorithm for multicast tree generation in networks with asymmetric links Ram Ramanathan, BBN Technologies
KDD (Data Mining)
2012Searching and Mining Trillions of Time Series Subsequences under Dynamic Time Warping Thanawin Rakthanmanon, University of California Riverside; et al.
2011Leakage in Data Mining: Formulation, Detection, and Avoidance Shachar Kaufman, Tel-Aviv University; et al.
2010Large linear classification when data cannot fit in memory Hsiang-Fu Yu, National Taiwan University; et al.
Connecting the dots between news articles Dafna Shahaf & Carlos Guestrin, Carnegie Mellon University
2009 Collaborative Filtering with Temporal Dynamics Yehuda Koren, Yahoo! Research
2008 Fastanova: an efficient algorithm for genome-wide association study Xiang Zhang, University of North Carolina at Chapel Hill; et al.
2007Predictive discrete latent factor models for large scale dyadic data Deepak Agarwal & Srujana Merugu, Yahoo! Research
2006 Training linear SVMs in linear time Thorsten Joachims, Cornell University
2005 Graphs over time: densification laws, shrinking diameters and possible explanations Jure Leskovec, Carnegie Mellon University; et al.
2004A probabilistic framework for semi-supervised clustering Sugato Basu, University of Texas at Austin; et al.
2003Maximizing the spread of influence through a social network David Kempe, Cornell University; et al.
2002Pattern discovery in sequences under a Markov assumption Darya Chudova & Padhraic Smyth, University of California Irvine
2001 Robust space transformations for distance-based operations Edwin M. Knorr, University of British Columbia; et al.
2000Hancock: a language for extracting signatures from data streams Corinna Cortes, AT&T Laboratories; et al.
1999MetaCost: a general method for making classifiers cost-sensitive Pedro Domingos, Universidade Técnica de Lisboa
1998 Occam's Two Razors: The Sharp and the Blunt Pedro Domingos, Universidade Técnica de Lisboa
1997 Analysis and Visualization of Classifier Performance: Comparison under Imprecise Class and Cost Di... Foster Provost & Tom Fawcett, NYNEX Science and Technology
MOBICOM (Mobile)
2012Distinguishing Users with Capacitative Touch Communication Tam Vu, Rutgers University; et al.
2011Detecting Driver Phone Use Leveraging Car Speakers Jie Yang, Stevens Institute of Technology; et al.
E-MiLi: Energy-Minimizing Idle Listening in Wireless Networks Xinyu Zhang & Kang G. Shin, University of Michigan
2010 The κ factor: inferring protocol performance using inter-link reception correlation Kannan Srinivasan, Stanford University; et al.
2009CENTAUR: Realizing the Full Potential of Centralized WLANs through a Hybrid Data Path Vivek Shrivastava, University of Wisconsin; et al.
2008Assessment of Urban-Scale Wireless Networks with a Small Number of Measurements Joshua Robinson, Rice University; et al.
NSDI (Networking)
2013Embassies: Radically Refactoring the Web Jon Howell, Microsoft Research; et al.
A Fault-Tolerant Engineered Network Vincent Liu, University of Washington; et al.
2012Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing Matei Zaharia, University of California Berkeley; et al.
2011Design, Implementation and Evaluation of Congestion Control for Multipath TCP Damon Wischik, University College London; et al.
ServerSwitch: A Programmable and High Performance Platform for Data Center Networks Guohan Lu, Microsoft Research; et al.
2010Reverse traceroute Ethan Katz-Bassett, University of Washington; et al.
2009Sora: High Performance Software Radio Using General Purpose Multi-core Processors Kun Tan, Microsoft Research; et al.
TrInc: Small Trusted Hardware for Large Distributed Systems Dave Levin, University of Maryland; et al.
2008Remus: High Availability via Asynchronous Virtual Machine Replication Brendan Cully, University of British Columbia; et al.
Consensus Routing: The Internet as a Distributed System John P. John, University of Washington; et al.
2007Life, Death, and the Critical Transition: Finding Liveness Bugs in Systems Code Charles Killian, University of California San Diego; et al.
2006Experience with an Object Reputation System for Peer-to-Peer Filesharing Kevin Walsh & Emin Gün Sirer, Cornell University
Replay Debugging for Distributed Applications Dennis Geels, University of California Berkeley; et al.
2005Detecting BGP Configuration Faults with Static Analysis Nick Feamster & Hari Balakrishnan, Massachusetts Institute of Technology
2004Trickle: A Self-Regulating Algorithm for Code Propagation and Maintenance in Wireless Sensor Netwo... Philip Levis, University of California Berkeley; et al.
OSDI (Operating Systems)
2012Spanner: Google's Globally-Distributed Database James C. Corbett, Google; et al.
2010Efficient System-Enforced Deterministic Parallelism Amittai Aviram, Yale University; et al.
The Turtles Project: Design and Implementation of Nested Virtualization Muli Ben-Yehuda, IBM Research; et al.
2008KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs Cristian Cadar, Stanford University; et al.
Difference Engine: Harnessing Memory Redundancy in Virtual Machines Diwaker Gupta, University of California San Diego; et al.
DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Lan... Yuan Yu, Microsoft Research; et al.
2006Bigtable: A Distributed Storage System for Structured Data Fay Chang, Google; et al.
Rethink the Sync Edmund B. Nightingale, University of Michigan; et al.
2004Using Model Checking to Find Serious File System Errors Junfeng Yang, Stanford University; et al.
Recovering Device Drivers Michael M. Swift, University of Washington; et al.
2002Memory Resource Management in VMware ESX Server Carl A. Waldspurger, VMware
2000 Checking System Rules Using System-Specific, Programmer-Written Compiler Extensions Dawson Engler, Stanford University; et al.
1999IO-Lite: A Unified I/O Buffering and Caching System Vivek S. Pai, Rice University; et al.
1996Automatic Compiler-Inserted I/O Prefetching for Out-of-Core Applications Todd C. Mowry, University of Toronto; et al.
Safe Kernel Extensions Without Run-Time Checking George C. Necula & Peter Lee, Carnegie Mellon University
PLDI (Programming Languages)
2012 Concurrent Data Representation Synthesis Peter Hawkins, Stanford University; et al.
2011Data Representation Synthesis Peter Hawkins, Stanford University; et al.
2010Safe to the Last Instruction: Automated Verification of a Type-Safe Operating System Jean Yang, Massachusetts Institute of Technology
Chris Hawblitzel, Microsoft Research
2009Binary Analysis for Measurement and Attribution of Program Performance Nathan Tallent, Rice University; et al.
2007Fault-tolerant Typed Assembly Language Frances Perry, Princeton University; et al.
The Ant and the Grasshopper: Fast and Accurate Pointer Analysis for Millions of Lines of Code Ben Hardekopf & Calvin Lin, University of Texas at Austin
2005 Automatic Pool Allocation: Improving Performance by Controlling Data Structure Layout in the Heap Chris Lattner & Vikram Adve, University of Illinois at Urbana-Champaign
Programming by Sketching for Bit-Streaming Programs Armando Solar-Lezama, University of California Berkeley; et al.
2004Cloning-Based Context-Sensitive Pointer Alias Analysis Using Binary Decision Diagrams John Whaley & Monica S. Lam, Stanford University
2003 Automatically Proving the Correctness of Compiler Optimizations Sorin Lerner, University of Washington; et al.
2000Dynamo: a transparent dynamic optimization system Vasanth Bala, Hewlett-Packard Labs; et al.
1999Whole program paths James R. Larus, Microsoft Research
PODS (Databases)
2012Worst-case Optimal Join Algorithms Hung Q. Ngo, University at Buffalo; et al.
2011Data Exchange Beyond Complete Data Marcelo Arenas, Pontificia Universidad Católica de Chile; et al.
2010An Optimal Algorithm for the Distinct Elements Problem Daniel M. Kane, Harvard University; et al.
2009Size and Treewidth Bounds for Conjunctive Queries Georg Gottlob, University of Oxford; et al.
2008Estimating PageRank on Graph Streams Atish Das Sarma, Georgia Institute of Technology; et al.
2007Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants Georg Gottlob, University of Oxford; et al.
2006Two-variable logic on data trees and XML reasoning Mikolaj Bojanczyk, Warsaw University; et al.
2005On the complexity of division and set joins in the relational algebra Dirk Leinders & Jan Van den Bussche, Limburgs Universitair Centrum
XML data exchange: consistency and query answering Marcelo Arenas & Leonid Libkin, University of Toronto
2004 Conditional XPath, the first order complete XPath dialect Maarten Marx, University of Amsterdam
2003 An Information-Theoretic Approach to Normal Forms for Relational and XML Data Marcelo Arenas & Leonid Libkin, University of Toronto
2002 Monadic Datalog and the Expressive Power of Languages for Web Information Extraction Georg Gottlob & Christoph Koch, Technische Universität Wien
2001 Optimal aggregation algorithms for middleware Ronald Fagin, IBM Research; et al.
2000Auditing Boolean attributes Jon Kleinberg, Cornell University; et al.
1999Exact and approximate aggregation in constraint query languages Michael Benefikt & Leonid Libkin, Bell Labs
1998 A lower bound theorem for indexing schemes and its application to multidimensional range queries Vasilis Samoladas & Daniel P. Miranker, University of Texas at Austin
Expressiveness of structured document query languages based on attribute grammars Frank Neven & Jan Van den Bussche, Limburgs Universitair Centrum
1997 On the Complexity of Database Queries Christos H. Papadimitriou, University of California Berkeley
Mihalis Yannakakis, Bell Labs
S&P (Security and Privacy)
2012 Don't Trust Satellite Phones: A Security Analysis of Two Satphone Standards Benedikt Driessen, Ruhr-Universität Bochum; et al.
2011Phonotactic Reconstruction of Encrypted VoIP Conversations: Hookt on fon-iks Andrew M. White, University of North Carolina at Chapel Hill; et al.
2010SCiFI - A System for Secure Face Identification Margarita Osadchy, University of Haifa; et al.
2009Native Client: A Sandbox for Portable, Untrusted x86 Native Code Bennet Yee, Google; et al.
2008Pacemakers and Implantable Cardiac Defibrillators: Software Radio Attacks and Zero-Power Defenses Daniel Halperin, University of Washington; et al.
SIGCOMM (Networking)
2012Multi-Resource Fair Queueing for Packet Processing Ali Ghodsi, University of California Berkeley; et al.
2011They Can Hear Your Heartbeats: Non-Invasive Security for Implanted Medical Devices Shyamnath Gollakota, Massachusetts Institute of Technology; et al.
2010Efficient Error Estimating Coding: Feasibility and Applications Binbin Chen, National University of Singapore; et al.
2009White Space Networking with Wi-Fi like Connectivity Paramvir Bahl, Microsoft Research; et al.
2008ZigZag Decoding: Combating Hidden Terminals in Wireless Networks Shyamnath Gollakota & Dina Katabi, Massachusetts Institute of Technology
SIGIR (Information Retrieval)
2012 Time-Based Calibration of Effectiveness Measures Mark Smucker & Charles Clarke, University of Waterloo
2011 Find It If You Can: A Game for Modeling Different Types of Web Search Success Using Interaction Data Mikhail Ageev, Moscow State University; et al.
2010Assessing the Scenic Route: Measuring the Value of Search Trails in Web Logs Ryen W. White, Microsoft Research
Jeff Huang, University of Washington
2009Sources of evidence for vertical selection Jaime Arguello, Carnegie Mellon University; et al.
2008Algorithmic Mediation for Collaborative Exploratory Search Jeremy Pickens, FX Palo Alto Lab; et al.
2007Studying the Use of Popular Destinations to Enhance Web Search Interaction Ryen W. White, Microsoft Research; et al.
2006Minimal Test Collections for Retrieval Evaluation Ben Carterette, University of Massachusetts Amherst; et al.
2005Learning to estimate query difficulty: including applications to missing content detection and dis... Elad Yom-Tov, IBM Research; et al.
2004A Formal Study of Information Retrieval Heuristics Hui Fang, University of Illinois at Urbana-Champaign; et al.
2003Re-examining the potential effectiveness of interactive query expansion Ian Ruthven, University of Strathclyde
2002 Novelty and redundancy detection in adaptive filtering Yi Zhang, Carnegie Mellon University; et al.
2001Temporal summaries of new topics James Allan, University of Massachusetts Amherst; et al.
2000IR evaluation methods for retrieving highly relevant documents Kalervo Järvelin & Jaana Kekäläinen, University of Tampere
1999 Cross-language information retrieval based on parallel texts and automatic mining of parallel text... Jian-Yun Nie, Université de Montréal; et al.
1998A theory of term weighting based on exploratory data analysis Warren R. Greiff, University of Massachusetts Amherst
1997 Feature selection, perceptron learning, and a usability case study for text categorization Hwee Tou Ng, DSO National Laboratories; et al.
1996Retrieving spoken documents by combining multiple index sources Gareth Jones, University of Cambridge; et al.
SIGMETRICS (Performance)
2012Temperature management in data centers: why some (might) like it hot Nosayba El-Sayed, University of Toronto; et al.
2011Topology Discovery of Sparse Random Graphs With Few Participants Animashree Anandkumar, University of California Irvine; et al.
2010Load balancing via random local search in closed and open systems Ayalvadi Ganesh, University of Bristol; et al.
2009The Age of Gossip: Spatial Mean Field Regime Augustin Chaintreau, Technicolor; et al.
2008Counter Braids: A Novel Counter Architecture for Per-Flow Measurement Yi Lu, Stanford University; et al.
2007Modeling the Relative Fitness of Storage Michael P. Mesnier, Intel; et al.
2006Maximizing throughput in wireless networks via gossiping Eytan Modiano, Massachusetts Institute of Technology; et al.
2005Coupon replication systems Laurent Massoulié & Milan Vojnović, Microsoft Research
2004 On performance bounds for the integration of elastic and adaptive streaming flows Thomas Bonald & Alexandre Proutiere, France Telecom
1996 Supporting stored video: reducing rate variability and end-to-end resource requirements through op... James D. Salehi, University of Massachusetts Amherst; et al.
Exploiting process lifetime distributions for dynamic load balancing Mor Harchol-Balter & Allen B. Downey, University of California Berkeley
SIGMOD (Databases)
2012High-Performance Complex Event Processing over XML Streams Barzan Mozafari, Massachusetts Institute of Technology; et al.
2011Entangled Queries: Enabling Declarative Data-Driven Coordination Nitin Gupta, Cornell University; et al.
2010FAST: fast architecture sensitive tree search on modern CPUs and GPUs Changkyu Kim, Intel; et al.
2009Generating example data for dataflow programs Christopher Olston, Yahoo! Research; et al.
2008Serializable isolation for snapshot databases Michael J. Cahill, University of Sydney; et al.
2007Compiling mappings to bridge applications and databases Sergey Melnik, Microsoft Research; et al.
2006To search or to crawl?: towards a query optimizer for text-centric tasks Panagiotis G. Ipeirotis, New York University; et al.
2004Indexing spatio-temporal trajectories with Chebyshev polynomials Yuhan Cai & Raymond T. Ng, University of British Columbia
2003 Spreadsheets in RDBMS for OLAP Andrew Witkowski, Oracle; et al.
2001Locally adaptive dimensionality reduction for indexing large time series databases Eamonn Keogh, University of California Irvine; et al.
2000XMill: an efficient compressor for XML data Hartmut Liefke, University of Pennsylvania
Dan Suciu, AT&T Laboratories
1999DynaMat: a dynamic view management system for data warehouses Yannis Kotidis & Nick Roussopoulos, University of Maryland
1998 Efficient transparent application recovery in client-server information systems David Lomet & Gerhard Weikum, Microsoft Research
1997 Fast parallel similarity search in multimedia databases Stefan Berchtold, University of Munich; et al.
1996Implementing data cubes efficiently Venky Harinarayan, Stanford University; et al.
SODA (Theory)
2013A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory Martin Grohe, RWTH Aachen University; et al.
Dynamic graph connectivity in polylogarithmic worst case time Bruce M. Kapron, University of Victoria; et al.
2012Computing all maps into a sphere Martin Čadek, Masaryk University; et al.
2011An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform Nir Ailon, Technion
Edo Liberty, Yahoo! Research
2010 An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour, Stanford University; et al.
2009Natural Algorithms Bernard Chazelle, Princeton University
SOSP (Operating Systems)
2011 A File is Not a File: Understanding the I/O Behavior of Apple Desktop Applications Tyler Harter, University of Wisconsin; et al.
Cells: A Virtual Mobile Smartphone Architecture Jeremy Andrus, Columbia University; et al.
2009FAWN: A Fast Array of Wimpy Nodes David G. Andersen, Carnegie Mellon University; et al.
seL4: Formal Verification of an OS Kernel Gerwin Klein, NICTA; et al.
RouteBricks: Exploiting Parallelism to Scale Software Routers Mihai Dobrescu, École Polytechnique Fédérale de Lausanne; et al.
2007Zyzzyva: speculative byzantine fault tolerance Ramakrishna Kotla, University of Texas at Austin; et al.
Sinfonia: a new paradigm for building scalable distributed systems Marcos K. Aguilera, Hewlett-Packard Labs; et al.
Secure Web Applications via Automatic Partitioning Stephen Chong, Cornell University; et al.
2005Speculative Execution in a Distributed File System Edmund B. Nightingale, University of Michigan; et al.
BAR Tolerance for Cooperative Services Amitanand S. Aiyer, University of Texas at Austin; et al.
Rx: treating bugs as allergies - a safe method to survive software failures Feng Qin, University of Illinois at Urbana-Champaign; et al.
Vigilante: End-to-End Containment of Internet Worms Manuel Costa, University of Cambridge; et al.
2003Backtracking intrusions Samuel T. King & Peter M. Chen, University of Michigan
Preserving peer replicas by rate-limited sampled voting Petros Maniatis, Stanford University; et al.
Improving the Reliability of Commodity Operating Systems Michael M. Swift, University of Washington; et al.
2001BASE: using abstraction to improve fault tolerance Rodrigo Rodrigues, Massachusetts Institute of Technology; et al.
Untrusted hosts and confidentiality: secure program partitioning Steve Zdancewic, Cornell University; et al.
1999Cellular Disco: resource management using virtual clusters on shared-memory multiprocessors Kinshuk Govil, Stanford University; et al.
Soft timers: efficient microsecond software timer support for network processing Mohit Aron & Peter Druschel, Rice University
The Click modular router Robert Morris, Massachusetts Institute of Technology; et al.
Manageability, availability and performance in Porcupine: a highly scalable, cluster-based mail se... Yasushi Saito, University of Washington; et al.
1997Continuous profiling: where have all the cycles gone? Jennifer M. Anderson, Digital Equipment Corporation; et al.
Disco: running commodity operating systems on scalable multiprocessors Edouard Bugnion, Stanford University; et al.
Eraser: a dynamic data race detector for multithreaded programs Stefan Savage, University of Washington; et al.
STOC (Theory)
2012Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds Samuel Fiorini, Université libre de Bruxelles; et al.
The Cell Probe Complexity of Dynamic Range Counting Kasper Larsen, Aarhus University
2011 Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs Paul Christiano, Massachusetts Institute of Technology; et al.
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm Oliver Friedmann, University of Munich; et al.
2010An improved LP-based approximation for steiner tree Jaroslaw Byrka, École Polytechnique Fédérale de Lausanne; et al.
QIP = PSPACE Rahul Jain, National University of Singapore; et al.
2009A constructive proof of the Lovász local lemma Robin A. Moser, ETH Zurich
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem Chris Peikert, SRI International
2008 Optimal algorithms and inapproximability results for every CSP? Prasad Raghavendra, University of Washington
Optimal hierarchical decompositions for congestion minimization in networks Harald Räcke, University of Warwick
2007 Faster integer multiplication Martin Fürer, Pennsylvania State University
Towards 3-query locally decodable codes of subexponential length Sergey Yekhanin, Massachusetts Institute of Technology
2006 The PCP theorem by gap amplification Irit Dinur, Hebrew University
2005 Undirected ST-connectivity in log-space Omer Reingold, Weizmann Institute of Science
2004 Multi-linear formulas for permanent and determinant are of super-polynomial size Ran Raz, Weizmann Institute of Science
Expander flows, geometric embeddings and graph partitioning Sanjeev Arora, Princeton University; et al.
2003Derandomizing polynomial identity tests means proving circuit lower bounds Valentine Kabanets & Russell Impagliazzo, University of California San Diego
New lattice-based cryptographic constructions Oded Regev, Tel-Aviv University
UIST (User Interface)
2012 CrowdScape: interactively visualizing user behavior and output Jeffrey Rzeszotarski & Aniket Kitur, Carnegie Mellon University
Cliplets: juxtaposing still and dynamic imagery Neel Joshi, Microsoft Research; et al.
Jamming User Interfaces: Programmable Particle Stiffness and Sensing for Malleable and Shape-Chang... Sean Follmer, Massachusetts Institute of Technology; et al.
2011SideBySide: Ad-hoc Multi-user Interaction with Handheld Projectors Karl D.D. Willis, Carnegie Mellon University; et al.
2010VizWiz: nearly real-time answers to visual questions Jeffrey P. Bigham, University of Rochester; et al.
2009Mouse 2.0: Multi-touch meets the Mouse Nicolas Villar, Microsoft Research; et al.
2008Bringing Physics to the Surface Andrew D. Wilson, Microsoft Research; et al.
2007ThinSight: Versatile Multi-touch Sensing for Thin Form-factor Displays Steve Hodges, Microsoft Research; et al.
2006Reflective Physical Prototyping through Integrated Design, Test, and Analysis Björn Hartmann, Stanford University; et al.
2005Automation and Customization of Rendered Web Pages Michael Bolin, Massachusetts Institute of Technology; et al.
2004Multi-Finger Gestural Interaction with 3D Volumetric Displays Tovi Grossman, University of Toronto; et al.
CrossY: A Crossing-Based Drawing Application Georg Apitz & François Guimbretière, University of Maryland
2003 Perceptually-Supported Image Editing of Text and Graphics Eric Saund, Palo Alto Research Center; et al.
2002Clothing Manipulation Takeo Igarashi, University of Tokyo
John F. Hughes, Brown University
2001Phidgets: Easy Development of Physical Interfaces through Physical Widgets Saul Greenberg & Chester Fitchett, University of Calgary
2000 Sensing Techniques for Mobile Interaction Ken Hinckley, Microsoft Research; et al.
1996Indigo: A Local Propagation Algorithm for Inequality Constraints Alan Borning, University of Washington; et al.
VLDB (Databases)
2012Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification Albert Angel, University of Toronto; et al.
2011RemusDB: Transparent High-Availability for Database Systems Umar Farooq Minhas, University of Waterloo; et al.
2010Towards Certain Fixes with Editing Rules and Master Data Shuai Ma, University of Edinburgh; et al.
2009A Unified Approach to Ranking in Probabilistic Databases Jian Li, University of Maryland; et al.
2008Finding Frequent Items in Data Streams Graham Cormode & Marios Hadjieleftheriou, AT&T Laboratories
Constrained Physical Design Tuning Nicolas Bruno & Surajit Chaudhuri, Microsoft Research
2007 Scalable Semantic Web Data Management Using Vertical Partitioning Daniel J. Abadi, Massachusetts Institute of Technology; et al.
2006Trustworthy Keyword Search for Regulatory-Compliant Records Retention Soumyadeb Mitra, University of Illinois at Urbana-Champaign; et al.
2005Cache-conscious Frequent Pattern Mining on a Modern Processor Amol Ghoting, Ohio State University; et al.
2004Model-Driven Data Acquisition in Sensor Networks Amol Deshpande, University of California Berkeley; et al.
2001Weaving Relations for Cache Performance Anastassia Ailamaki, Carnegie Mellon University; et al.
1997Integrating Reliable Memory in Databases Wee Teck Ng & Peter M. Chen, University of Michigan
WWW (World Wide Web)
2012Counting Beyond a Yottabyte, or how SPARQL 1.1 Property Paths will Prevent Adoption of the Standard Marcelo Arenas, Pontificia Universidad Católica de Chile; et al.
2011Towards a theory model for product search Beibei Li, New York University; et al.
2010Factorizing personalized Markov chains for next-basket recommendation Steffen Rendle, Osaka University; et al.
2009Hybrid keyword search auctions Ashish Goel, Stanford University
Kamesh Munagala, Duke University
2008 IRLbot: Scaling to 6 billion pages and beyond Hsin-Tsang Lee, Texas A&M University; et al.
2007Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganogra... Lars Backstrom, Cornell University; et al.
2006Random Sampling from a Search Engine's Index Ziv Bar-Yossef & Maxim Gurevich, Technion
2005 Three-level caching for efficient query processing in large Web search engines Xiaohui Long & Torsten Suel, Polytechnic Institute of New York University
2004Automatic detection of fragments in dynamically generated web pages Lakshmish Ramaswamy, Georgia Institute of Technology; et al.
2003Scaling personalized web search Glen Jeh & Jennifer Widom, Stanford University
SemTag and seeker: bootstrapping the semantic web via automated semantic annotation Stephen Dill, IBM Research; et al.
2002Abstracting application-level web security David Scott & Richard Sharp, University of Cambridge
2001 Engineering Server Driven Consistency for Large Scale Dynamic Web Services Jian Yin, University of Texas at Austin; et al.
2000Graph Structure in the Web Andrei Broder, AltaVista; et al.
1999Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery Soumen Chakrabarti, Indian Institute of Technology; et al.
1998The Interactive Multimedia Jukebox (IMJ): a new paradigm for the on-demand delivery of audio/video Kevin C. Almeroth, University of California Santa Barbara
Mostafa H. Ammar, Georgia Institute of Technology


Institutions with Best Papers
Microsoft Research29.5
Stanford University25.5
Carnegie Mellon University 22.9
University of Washington21.3
Massachusetts Institute of Technology20.7
University of California Berkeley 18.3
University of Toronto 13.3
Cornell University11.9
University of Illinois at Urbana-Champaign10.3
University of Texas at Austin 9.4
IBM Research9.4
University of British Columbia8.8
University of California Irvine6.5
University of Massachusetts Amherst 6.2
University of Oxford6.2
Georgia Institute of Technology6.0
Google 5.8
Princeton University5.6
University of Maryland5.6
University of Michigan 5.2
AT&T Laboratories4.9
Yahoo! Research4.8
McGill University 4.7
Weizmann Institute of Science4.5
University of Nottingham4.3
Rice University 4.2
University of California San Diego4.2
École Polytechnique Fédérale de Lausanne3.9
Technion 3.8
University of Wisconsin3.5
Brown University3.3
Bell Labs 3.3
Hewlett-Packard Labs3.2
Université Paris-Sud3.1
Columbia University 3.1
National University of Singapore3.0
DePaul University3.0
University of Alberta 3.0
Indiana University at Bloomington3.0
University of North Carolina at Chapel Hill2.8
Technische Universität Berlin 2.7
NEC Labs America 2.7
University of Waterloo2.7
University of Nebraska-Lincoln2.6
Max Planck Institut 2.6
University of Cambridge2.6
Ohio State University2.4
Duke University 2.3
Toyota Technological Institute at Chicago2.3
University of Pennsylvania2.3
Aarhus University 2.3
RWTH Aachen University2.2
Tel-Aviv University2.2
University of Calgary 2.1
Saarland University2.1
Intel Research2.0
Hasso Plattner Institute 2.0
Polytechnic Institute of New York University2.0
University College London2.0
Universidade Técnica de Lisboa 2.0
BBN Technologies2.0
NASA Ames Research Center2.0

Credit is given in decreasing author order as customary in many fields. First authors are given 1 point, second authors are given 0.5 points, third authors are given 0.33 points, etc. These points are then divided by the sum of points for that paper, i.e. normalizing it. This ranking may be inaccurate or incomplete, may not reflect the current state of best paper awards, and is not an official list. If you are not satisfied with the ranking listed here, please disregard it.


Back to Jeff Huang's Homepage


Page last updated: 2013-04-10