Author image not provided
 Liane Lewin-Eytan

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article8.00
Citation Count152
Publication count19
Publication years2002-2017
Available for download13
Average downloads per article279.77
Downloads (cumulative)3,637
Downloads (12 Months)936
Downloads (6 Weeks)161
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


22 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 22
Result page: 1 2

Sort by:

1 published by ACM
June 2018 SIGIR '18: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 27,   Downloads (12 Months): 111,   Downloads (Overall): 111

Full text available: PDFPDF
Alexa is an intelligent personal assistant developed by Amazon, that can provide many services through voice interaction such as music playback, news, question-answering, and on-line shopping. The Alexa shopping research team in Amazon is a new emerging group of scientists who investigate revolutionary shopping experience through Alexa, while devising new ...

2
April 2018 WWW '18: Companion Proceedings of the The Web Conference 2018
Publisher: International World Wide Web Conferences Steering Committee
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 20,   Downloads (12 Months): 89,   Downloads (Overall): 89

Full text available: HtmlHtml  PDFPDF
Mail extraction is a critical task whose objective is to extract valuable data from the content of mail messages. This task is key for many types of applications including re-targeting, mail search, and mail summarization, which utilize the important personal data pieces in mail messages to achieve their objectives. We ...
Keywords: automated extraction, machine generated mail, mail clustering, mail extraction

3 published by ACM
February 2018 WSDM '18: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 30,   Downloads (12 Months): 249,   Downloads (Overall): 249

Full text available: PDFPDF
The constant growth of machine-generated mail, which today consists of more than 90% of non-spam mail traffic, is a major contributor to information overload in email, where users become overwhelmed with a flood of messages from commercial entities. A large part of this traffic is often junk mail that the ...
Keywords: unsubscription recommendations, machine-generated mail, mail mining

4 published by ACM
August 2017 SIGIR '17: Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 12,   Downloads (12 Months): 82,   Downloads (Overall): 122

Full text available: PDFPDF
Recent research studies on mail search have shown that the longer the query, the better the quality of results, yet a majority of mail queries remain very short and searchers struggle with formulating queries. A known mechanism to assist users in this task is query auto-completion, which has been highly ...
Keywords: mail search, query auto completion, query suggestion

5
April 2017 WWW '17: Proceedings of the 26th International Conference on World Wide Web
Publisher: International World Wide Web Conferences Steering Committee
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 7,   Downloads (12 Months): 28,   Downloads (Overall): 46

Full text available: PDFPDF
Mail search has traditionally served time-ranked results, even if it has been shown that relevance ranking provides higher retrieval quality on average. Some Web mail services have recently started to provide relevance ranking options such as the relevance toggle in the search results page of Yahoo Mail, or the ``top ...
Keywords: mail search ranking, time ranking, relevance ranking, mail search, personal search

6
April 2017 WWW '17: Proceedings of the 26th International Conference on World Wide Web
Publisher: International World Wide Web Conferences Steering Committee
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 10,   Downloads (12 Months): 44,   Downloads (Overall): 76

Full text available: PDFPDF
Web mail search is an emerging topic, which has not been the object of as many studies as traditional Web search. In particular, little is known about the characteristics of mail searchers and of the queries they issue. We study here the characteristics of Web mail searchers, and explore how ...
Keywords: query auto-completion, query suggestion, mail search, mail search demographics

7 published by ACM
October 2016 CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 13,   Downloads (12 Months): 81,   Downloads (Overall): 158

Full text available: PDFPDF
Several recent studies have presented different approaches for clustering and classifying machine-generated mail based on email headers. We propose to expand these approaches by considering email message bodies. We argue that our approach can help increase coverage and precision in several tasks, and is especially critical for mail extraction. We ...
Keywords: machine generated mail, mail classification, mail clustering, mail extraction, mail mining, mail structural clustering

8 published by ACM
February 2016 WSDM '16: Proceedings of the Ninth ACM International Conference on Web Search and Data Mining
Publisher: ACM
Bibliometrics:
Citation Count: 16
Downloads (6 Weeks): 13,   Downloads (12 Months): 92,   Downloads (Overall): 517

Full text available: PDFPDF
With email traffic increasing, leading Web mail services have started to offer features that assist users in reading and processing their inboxes. One approach is to identify "important" messages, while a complementary one is to bundle messages, especially machine-generated ones, in pre-defined categories. We rather propose here to go back ...
Keywords: actions, email, email message, predicting actions

9 published by ACM
February 2016 WSDM '16: Proceedings of the Ninth ACM International Conference on Web Search and Data Mining
Publisher: ACM
Bibliometrics:
Citation Count: 10
Downloads (6 Weeks): 6,   Downloads (12 Months): 46,   Downloads (Overall): 230

Full text available: PDFPDF
We study the problem of k-anonymization of mail messages in the realistic scenario of auditing mail traffic in a major commercial Web mail service. Mail auditing is necessary in various Web mail debugging and quality assurance activities, such as anti-spam or the qualitative evaluation of novel mail features. It is ...
Keywords: k-anonymization, mail auditing, mail templating, quality assurance

10 published by ACM
October 2015 CIKM '15: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management
Publisher: ACM
Bibliometrics:
Citation Count: 16
Downloads (6 Weeks): 11,   Downloads (12 Months): 64,   Downloads (Overall): 421

Full text available: PDFPDF
With Web mail services offering larger and larger storage capacity, most users do not feel the need to systematically delete messages anymore and inboxes keep growing. It is quite surprising that in spite of the huge progress of relevance ranking in Web Search, mail search results are still typically ranked ...
Keywords: email search, ranking

11 published by ACM
May 2015 ACM Transactions on Parallel Computing - Special Issue on SPAA 2012: Volume 2 Issue 1, May 2015
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Downloads (Overall): 124

Full text available: PDFPDF
Clustering, the partitioning of objects with respect to a similarity measure, has been extensively studied as a global optimization problem. We investigate clustering from a game-theoretic approach, and consider the class of hedonic clustering games . Here, a self-organized clustering is obtained via decisions made by independent players, corresponding to ...
Keywords: hedonic games, price of anarchy, price of stability, Clustering games

12 published by ACM
June 2013 SYSTOR '13: Proceedings of the 6th International Systems and Storage Conference
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 2,   Downloads (Overall): 99

Full text available: PDFPDF
Publish/subscribe based communication systems have become very popular in recent years. Such systems are becoming larger and more complex, and thus require a smart management framework. An important challenge in this context is to efficiently disseminate the data flows sent from the publishers to the subscribers. To this aim, multicast ...
Keywords: channelization, mapping algorithm, publish/subscribe systems, multicast, overlay networks

13 published by ACM
June 2012 SPAA '12: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Downloads (Overall): 123

Full text available: PDFPDF
Clustering, the partitioning of objects with respect to a similarity measure, has been extensively studied as a global optimization problem. We investigate clustering from a game theoretic approach, and consider the class of hedonic clustering games. Here, a self organized clustering is obtained via decisions made by independent players, corresponding ...
Keywords: clustering games, hedonic games, price of anarchy, price of stability

14
April 2012 IEEE/ACM Transactions on Networking (TON): Volume 20 Issue 2, April 2012
Publisher: IEEE Press
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 4,   Downloads (12 Months): 17,   Downloads (Overall): 151

Full text available: PDFPDF
A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nature of the wireless domain. We consider in this paper the single-transmitter power assignment problem under time-varying channels, with the objective of ...
Keywords: dynamic power allocation, online algorithms, channel fading, competitive ratio

15
July 2010 Theory of Computing Systems - Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder: Volume 47 Issue 1, July 2010
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 5

We consider a cost sharing system where users are selfish and act according to their own interest. There is a set of facilities and each facility provides services to a subset of the users. Each user is interested in purchasing a service, and will buy it from the facility offering ...
Keywords: Price of anarchy, Cost-sharing, Game theory, Set-cover, Taxes, Non-cooperative games, Subsides

16
March 2010 INFOCOM'10: Proceedings of the 29th conference on Information communications
Publisher: IEEE Press
Bibliometrics:
Citation Count: 2

We consider the power control problem in a time-slotted wireless channel, shared by a finite number of mobiles that transmit to a common base station. The channel between each mobile and the base station is time varying, and the system objective is to maximize the overall data throughput. It is ...

17
April 2008 SAGT '08: Proceedings of the 1st International Symposium on Algorithmic Game Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

We consider a cost sharing system where users are selfish and act according to their own interest. There is a set of facilities and each facility provides services to a subset of the users. Each user is interested in purchasing a service, and will buy it from the facility offering ...

18 published by ACM
September 2007 MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 1,   Downloads (12 Months): 1,   Downloads (Overall): 722

Full text available: PDFPDF
Routing traffic so as to maximize the lifetime of a transmission is a major problem in wireless networks. We address a two-way multicast problem, where a root wishes to transmit data to a subset of nodes, as well as receive data from them. In addition, we consider the anycast problem, ...
Keywords: anycast game, multicast game, nash equilibrium, price of anarchy, price of stability

19
August 2007 IEEE Journal on Selected Areas in Communications: Volume 25 Issue 6, August 2007
Publisher: IEEE Press
Bibliometrics:
Citation Count: 23

We consider a multicast game with selfish non- cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing decision that minimizes its payment. The mutual influence of the players is determined by a cost sharing mechanism, which in ...

20 published by ACM
June 2006 EC '06: Proceedings of the 7th ACM conference on Electronic commerce
Publisher: ACM
Bibliometrics:
Citation Count: 19
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 392

Full text available: PDFPDF
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing decision that minimizes its payment. The mutual influence of the players is determined by a cost sharing mechanism, which in our ...
Keywords: multicast game, price of stability, nash equilibrium, price of anarchy



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us