Concept

Microsoft Edge

Related publications (16)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Autonomous-System Interfaces

The current Internet is characterized by a growing tension between the "core" (the Internet service providers) and the "edge" (the operators of edge networks and distributed applications). Much of this tension concerns path visibility and control -- where ...

2007

Prospection sur les images numériques proche infrarouge

Gilles Gachet

Introduction Les caméras multispectrales - Caractéristiques (tableau comparatif) Analyse du bruit (entropie) Analyse de la résolution effective (Full Width of edge response at Half Height) Comparaison des résolutions spatiales Formats de compression Rehaus ...

2006

Opportunistic search with semantic fisheye views

Pearl Pu Faltings

Search goals are often too complex or poorly defined to be solved with a single query in a Web-based information environment. In this paper we describe how we use semantic fisheye views (SFEVs) to effectively support opportunistic search and browsing strat ...

Springer-Verlag2004

Specification and Implementation of Dynamic Web Site Benchmarks

Willy Zwaenepoel, Sameh Mohamed Elnikety, Emmanuel Cecchet

The absence of benchmarks for Web sites with dynamic content has been a major impediment to research in this area. We describe three benchmarks for evaluating the performance of Web sites with dynamic content. The benchmarks model three common types of dyn ...

2002

Link Weighting: An Important Basis for Charging in the Internet

Paul Hurley

Current charging mechanisms in the Internet are restricted mainly to volume and time of the day. We propose a mechanism which allows to use additional information for charging in the edges and core of the network. Links or network clouds will have weights ...

1998

Optimally Profiling and Tracing Programs

James Richard Larus

This paper describes algorithms for inserting monitoring code to profile and trace programs. These algorithms greatly reduce the cost of measuring programs with respect to the commonly used technique of placing code in each basic block. Program profiling c ...

ACM1994