Search results for "Edith Cohen"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Edith Cohen, Haim Kaplan	How to Estimate Change from Samples	CoRR	2012	DBLP BibTeX RDF
1	Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky	Envy-Free Makespan Approximation.	SIAM J. Comput.	2012	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Get the Most out of Your Sample: Optimal Unbiased Estimators using Partial Information	CoRR	2011	DBLP BibTeX RDF
1	Edith Cohen, Graham Cormode, Nick G. Duffield	Structure-Aware Sampling: Flexible and Accurate Summarization	CoRR	2011	DBLP BibTeX RDF
1	Edith Cohen, Graham Cormode, Nick G. Duffield	Structure-Aware Sampling: Flexible and Accurate Summarization.	PVLDB	2011	DBLP BibTeX RDF
1	Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup	Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums.	SIAM J. Comput.	2011	DBLP DOI BibTeX RDF
1	Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky	Truth, Envy, and Truthful Market Clearing Bundle Pricing.	WINE	2011	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Get the most out of your sample: optimal unbiased estimators using partial information.	PODS	2011	DBLP DOI BibTeX RDF
1	Edith Cohen, Graham Cormode, Nick G. Duffield	Structure-aware sampling on data streams.	SIGMETRICS	2011	DBLP DOI BibTeX RDF
1	Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky	On the Interplay between Incentive Compatibility and Envy Freeness	CoRR	2010	DBLP BibTeX RDF
1	Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky	Truth and Envy in Capacitated Allocation Games	CoRR	2010	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan, Tova Milo	Labeling Dynamic XML Trees.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
1	Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky	Envy-free makespan approximation: extended abstract.	ACM Conference on Electronic Commerce	2010	DBLP DOI BibTeX RDF	envy free, job scheduling, makespan
1	Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky	Envy-Free Makespan Approximation	CoRR	2009	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan, Subhabrata Sen	Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments	CoRR	2009	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan	Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates	CoRR	2009	DBLP BibTeX RDF
1	Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup	Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets.	PVLDB	2009	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan, Subhabrata Sen	Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments.	PVLDB	2009	DBLP BibTeX RDF
1	Edith Cohen	Decay Models.	Encyclopedia of Database Systems	2009	DBLP DOI BibTeX RDF
1	Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup	Stream sampling for variance-optimal estimation of subset sums.	SODA	2009	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Leveraging discarded samples for tighter estimation of multiple-set aggregates.	SIGMETRICS/Performance	2009	DBLP DOI BibTeX RDF	bottom-k sampling, coordinated sampling, multiple-set aggregates, order sampling, sketches, approximate query processing
1	Edith Cohen, Nadav Grossaug, Haim Kaplan	Processing top-k queries from samples.	Computer Networks	2008	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Sketch-Based Estimation of Subpopulation-Weight	CoRR	2008	DBLP BibTeX RDF
1	Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup	Variance optimal sampling based estimation of subset sums	CoRR	2008	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan	Tighter estimation using bottom k sketches.	PVLDB	2008	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan	Estimating Aggregates over Multiple Sets.	ICDM	2008	DBLP DOI BibTeX RDF
1	Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup	Confident estimation for multistage measurement sampling and aggregation.	SIGMETRICS	2008	DBLP DOI BibTeX RDF	sampling, estimation, network measurement, confidence intervals
1	Edith Cohen, Amos Fiat, Haim Kaplan	Associative search in peer to peer networks: Harnessing latent semantics.	Computer Networks	2007	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Spatially-decaying aggregation over a network.	J. Comput. Syst. Sci.	2007	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Summarizing data using bottom-k sketches.	PODC	2007	DBLP DOI BibTeX RDF	all-distances sketches, bottom-k sketches, data streams
1	Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup	Sketching unaggregated data streams for subpopulation-size queries.	PODS	2007	DBLP DOI BibTeX RDF	subpopulation size, data streams, sketches, IP flows
1	Edith Cohen, Haim Kaplan	Bottom-k sketches: better and more efficient estimation of aggregates.	SIGMETRICS	2007	DBLP DOI BibTeX RDF	bottom-k, sampling, sketches, approximate query processing
1	Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup	Algorithms and estimators for accurate summarization of internet traffic.	Internet Measurement Comference	2007	DBLP DOI BibTeX RDF	ip flows, subpopulation queries, data streams, network management, sketches, netflow
1	Edith Cohen, Martin J. Strauss	Maintaining time-decaying stream aggregates.	J. Algorithms	2006	DBLP DOI BibTeX RDF
1	David Applegate, Edith Cohen	Making routing robust to changing traffic demands: algorithms and evaluation.	IEEE/ACM Trans. Netw.	2006	DBLP DOI BibTeX RDF	routing, traffic engineering, oblivious routing
1	Edith Cohen, Balachander Krishnamurthy	A short walk in the Blogistan.	Computer Networks	2006	DBLP DOI BibTeX RDF
1	Edith Cohen, Nadav Grossaug, Haim Kaplan	Processing top k queries from samples.	CoNEXT	2006	DBLP DOI BibTeX RDF
1	Edith Cohen, Eran Halperin, Haim Kaplan	Performance aspects of distributed caches using TTL-based consistency.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
1	Edith Cohen, Carsten Lund	Packet classification in large ISPs: design and evaluation of decision tree classifiers.	SIGMETRICS	2005	DBLP DOI BibTeX RDF	routing, decision trees, packet filtering, access control lists
1	Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke	Optimal oblivious routing in polynomial time.	J. Comput. Syst. Sci.	2004	DBLP DOI BibTeX RDF
1	Edith Cohen, Venkatesan Guruswami	Guest Editors' foreword.	J. Comput. Syst. Sci.	2004	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Balanced-Replication Algorithms for Distribution Trees.	SIAM J. Comput.	2004	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Efficient estimation algorithms for neighborhood variance and other moments.	SODA	2004	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Spatially-decaying aggregation over a network: model and algorithms. (PDF / PS)	SIGMOD Conference	2004	DBLP DOI BibTeX RDF
1	David Applegate, Lee Breslau, Edith Cohen	Coping with network failures: routing strategies for optimal demand oblivious restoration.	SIGMETRICS	2004	DBLP DOI BibTeX RDF	demand-oblivious routing, routing, restoration
1	Edith Cohen, Amos Fiat, Haim Kaplan	A case for associative peer to peer overlays.	Computer Communication Review	2003	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Proactive caching of DNS records: addressing a performance bottleneck.	Computer Networks	2003	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan, Uri Zwick	Connection caching: model and algorithms.	J. Comput. Syst. Sci.	2003	DBLP DOI BibTeX RDF
1	Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick	Reachability and Distance Queries via 2-Hop Labels.	SIAM J. Comput.	2003	DBLP DOI BibTeX RDF
1	Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour	Predicting and bypassing end-to-end Internet service degradations.	IEEE Journal on Selected Areas in Communications	2003	DBLP DOI BibTeX RDF
1	Edith Cohen, Amos Fiat, Haim Kaplan	Efficient sequences of trials.	SODA	2003	DBLP DOI BibTeX RDF
1	David Applegate, Edith Cohen	Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs.	SIGCOMM	2003	DBLP DOI BibTeX RDF	TM estimation, demand-oblivious routing, routing
1	Edith Cohen, Amos Fiat, Haim Kaplan	Associative Search in Peer to Peer Networks: Harnessing Latent Semantics.	INFOCOM	2003	DBLP BibTeX RDF
1	Edith Cohen, Martin Strauss	Maintaining time-decaying stream aggregates.	PODS	2003	DBLP DOI BibTeX RDF
1	Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke	Optimal oblivious routing in polynomial time.	STOC	2003	DBLP DOI BibTeX RDF	ellipsoid algorithm, oblivious routing
1	Edith Cohen, Haim Kaplan	Exploiting Regularities in Web Traffic Patterns for Cache Replacement.	Algorithmica	2002	DBLP DOI BibTeX RDF	Varying page sizes and fetching costs, Predictable load, Inter-request time distribution, Caching, Interval caching
1	Edith Cohen, Haim Kaplan	Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach.	Algorithmica	2002	DBLP DOI BibTeX RDF	Caching, Linear programming
1	Edith Cohen, Haim Kaplan, Uri Zwick	Competitive Analysis of the LRFU Paging Algorithm.	Algorithmica	2002	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Prefetching the means for document transfer: a new approach for reducing Web latency.	Computer Networks	2002	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Refreshment policies for Web content caches.	Computer Networks	2002	DBLP DOI BibTeX RDF
1	Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt	Restoration by path concatenation: fast recovery of MPLS paths.	Distributed Computing	2002	DBLP DOI BibTeX RDF	MPLS, Restoration, OSPF, Shortest-path problem
1	Edith Cohen, Haim Kaplan	Balanced-Replication Algorithms for Distribution Trees.	ESA	2002	DBLP DOI BibTeX RDF
1	Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick	Reachability and distance queries via 2-hop labels.	SODA	2002	DBLP DOI BibTeX RDF
1	Edith Cohen, Scott Shenker	Replication strategies in unstructured peer-to-peer networks.	SIGCOMM	2002	DBLP DOI BibTeX RDF	peer-to-peer, replication, random search
1	Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker	Search and replication in unstructured peer-to-peer networks.	ICS	2002	DBLP DOI BibTeX RDF	peer-to-peer, search, replication, unstructured
1	Edith Cohen, Haim Kaplan, Tova Milo	Labeling Dynamic XML Trees. (PDF / PS)	PODS	2002	DBLP DOI BibTeX RDF	XML
1	Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker	Search and replication in unstructured peer-to-peer networks.	SIGMETRICS	2002	DBLP DOI BibTeX RDF
1	Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour	Predicting and bypassing end-to-end internet service degradations.	Internet Measurement Workshop	2002	DBLP DOI BibTeX RDF
1	Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang	Finding Interesting Associations without Support Pruning.	IEEE Trans. Knowl. Data Eng.	2001	DBLP DOI BibTeX RDF	min hashing, Data mining, association rules, locality sensitive hashing, similarity metric
1	Edith Cohen, Uri Zwick	All-Pairs Small-Stretch Paths.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	Edith Cohen, Eran Halperin, Haim Kaplan	Performance Aspects of Distributed Caches Using TTL-Based Consistency.	ICALP	2001	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Aging through cascaded caches: performance issues in the distribution of web content.	SIGCOMM	2001	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan, Uri Zwick	Competitive Analysis of the LRFU Paging Algorithm.	WADS	2001	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Refreshment Policies for Web Content Caches.	INFOCOM	2001	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan	The Age Penalty and Its Effect on Cache Performance.	USITS	2001	DBLP BibTeX RDF
1	Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt	Restoration by path concatenation: fast recovery of MPLS paths.	PODC	2001	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Proactive Caching of DNS Records: Addressing a Performance Bottleneck. (PDF / PS)	SAINT	2001	DBLP DOI BibTeX RDF
1	Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt	Restoration path concatenation: fast recovery of MPLS paths.	SIGMETRICS/Performance	2001	DBLP DOI BibTeX RDF
1	Edith Cohen	Polylog-time and near-linear work approximation scheme for undirected shortest paths.	J. ACM	2000	DBLP DOI BibTeX RDF
1	Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang	Finding Interesting Associations without Support Pruning.	ICDE	2000	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency.	INFOCOM	2000	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan, Uri Zwick	Connection caching under vaious models of communication.	SPAA	2000	DBLP DOI BibTeX RDF
1	Edith Cohen, David D. Lewis	Approximating Matrix Multiplication for Pattern Recognition Tasks.	J. Algorithms	1999	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan, Jeffrey D. Oldham	Managing TCP Connections Under Persistent HTTP.	Computer Networks	1999	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	LP-based Analysis of Greedy-dual-size.	SODA	1999	DBLP DOI BibTeX RDF
1	Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford	Efficient Algorithms for Predicting Requests to Web Servers.	INFOCOM	1999	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan, Uri Zwick	Connection Caching.	STOC	1999	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan	Exploiting Regularities in Web Traffic Patterns for Cache Replacement.	STOC	1999	DBLP DOI BibTeX RDF
1	Edith Cohen	Structure Prediction and Computation of Sparse Matrix Products.	J. Comb. Optim.	1998	DBLP DOI BibTeX RDF
1	Edith Cohen	Fast Algorithms for Constructing t-Spanners and Paths with Stretch t.	SIAM J. Comput.	1998	DBLP DOI BibTeX RDF
1	Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford	Evaluating Server-Assisted Cache Replacement in the Web.	ESA	1998	DBLP DOI BibTeX RDF
1	Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford	Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters.	SIGCOMM	1998	DBLP DOI BibTeX RDF	World Wide Web (WWW), caching, Web, filters, prefetching, coherency, volumes, piggybacking
1	Edith Cohen	Using Selective Path-Doubling for Parallel Shortest-Path Computations.	J. Algorithms	1997	DBLP DOI BibTeX RDF
1	Edith Cohen	Size-Estimation Framework with Applications to Transitive Closure and Reachability.	J. Comput. Syst. Sci.	1997	DBLP DOI BibTeX RDF
1	Edith Cohen, Uri Zwick	All-Pairs Small-Stretch Paths.	SODA	1997	DBLP DOI BibTeX RDF
1	Edith Cohen, David D. Lewis	Approximating Matrix Multiplication for Pattern Recognition Tasks.	SODA	1997	DBLP DOI BibTeX RDF
1	Edith Cohen	Learning Noisy Perceptrons by a Perceptron in Polynomial Time.	FOCS	1997	DBLP DOI BibTeX RDF	noisy perceptron learning, linear threshold functions, labeled examples, random classification noise, PAC learnable, linear thresholds, single threshold function, machine learning, polynomial time, learning by example, hypothesis
1	Edith Cohen	Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition.	J. Algorithms	1996	DBLP DOI BibTeX RDF
1	Edith Cohen	On Optimizing Multiplications of Sparse Matrices.	IPCO	1996	DBLP DOI BibTeX RDF
1	Edith Cohen	Approximate Max-Flow on Small Depth Networks.	SIAM J. Comput.	1995	DBLP DOI BibTeX RDF

Publications of "Edith Cohen" ( http://dblp.L3S.de/Authors/Edith_Cohen )