#### Filter Results:

- Full text PDF available (249)

#### Publication Year

1982

2019

- This year (29)
- Last 5 years (218)
- Last 10 years (408)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos
- SIGCOMM
- 1999

Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for three snapshots of the Internet, between Novemberâ€¦ (More)

- Rakesh Agrawal, Christos Faloutsos, Arun N. Swami
- FODO
- 1993

We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observationâ€¦ (More)

- Christos Faloutsos, Mudumbai Ranganathan, Yannis Manolopoulos
- SIGMOD Conference
- 1994

We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance.â€¦ (More)

Given a water distribution network, where should we place sensors toquickly detect contaminants? Or, which blogs should we read to avoid missing important stories?.
These seemingly differentâ€¦ (More)

How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifyingâ€¦ (More)

- Jure Leskovec, Jon M. Kleinberg, Christos Faloutsos
- TKDD
- 2007

How do real graphs evolve over time? What are normal growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying propertiesâ€¦ (More)

How does a â€˜normalâ€™ computer (or social) network look like? How can we spot â€˜abnormalâ€™ sub-networks in the Internet, or web graph? The answer to such questions is vital for outlier detectionâ€¦ (More)

- Christos Faloutsos, King-Ip Lin
- SIGMOD Conference
- 1995

A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [25].â€¦ (More)

- Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos, Zoubin Ghahramani
- Journal of Machine Learning Research
- 2010

How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of networ k properties? Real networks exhibit a long listâ€¦ (More)

- Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
- Sixth International Conference on Data Miningâ€¦
- 2006

How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance score between two nodesâ€¦ (More)