Sciweavers

2421 search results - page 265 / 485
» Approximate Flow-Aware Networking
Sort
View
MOBIHOC
2007
ACM
16 years 3 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
TOG
2002
141views more  TOG 2002»
15 years 3 months ago
Geometry images
Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, whi...
Xianfeng Gu, Steven J. Gortler, Hugues Hoppe
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 3 months ago
Non-atomic Games for Multi-User Systems
Abstract—In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful frame...
Nicolas Bonneau, Mérouane Debbah, Eitan Alt...
TEC
2008
135views more  TEC 2008»
15 years 3 months ago
Evolving Output Codes for Multiclass Problems
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
Nicolás García-Pedrajas, Colin Fyfe
INFOCOM
2010
IEEE
15 years 2 months ago
Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow
—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the ...
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...