Sciweavers

174 search results - page 14 / 35
» Traces of Term-Automatic Graphs
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
COMBINATORICS
2004
74views more  COMBINATORICS 2004»
13 years 7 months ago
Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
Pierre Leroux
PUK
2003
13 years 9 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
SIGGRAPH
1999
ACM
13 years 12 months ago
Real-Time Acoustic Modeling for Distributed Virtual Environments
Realistic acoustic modeling is essential for spatializing sound in distributed virtual environments where multiple networked users move around and interact visually and aurally in...
Thomas A. Funkhouser, Patrick Min, Ingrid Carlbom
STOC
2003
ACM
118views Algorithms» more  STOC 2003»
14 years 7 months ago
A proof of Alon's second eigenvalue conjecture
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. In this paper we show the following conjecture of Alon. Fix an integer d > 2 and a real > 0. Then...
Joel Friedman