Sciweavers

3244 search results - page 508 / 649
» On convex complexity measures
Sort
View
CCR
2006
76views more  CCR 2006»
15 years 6 months ago
Unwanted traffic in 3G networks
The presence of "unwanted" (or background) traffic in the Internet is a well-known fact. In principle any network that has been engineered without taking its presence in...
Fabio Ricciato
CN
2006
79views more  CN 2006»
15 years 6 months ago
Explicit rate multicast congestion control
In this article, we propose a new single-rate end-to-end multicast congestion control scheme called Explicit Rate Multicast Congestion Control (ERMCC) based on a new metric, TRAC ...
Jiang Li, Murat Yuksel, Shivkumar Kalyanaraman
CONCURRENCY
2006
140views more  CONCURRENCY 2006»
15 years 6 months ago
An efficient memory operations optimization technique for vector loops on Itanium 2 processors
To keep up with a large degree of instruction level parallelism (ILP), the Itanium 2 cache systems use a complex organization scheme: load/store queues, banking and interleaving. ...
William Jalby, Christophe Lemuet, Sid Ahmed Ali To...
IJAR
2008
167views more  IJAR 2008»
15 years 6 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
GIS
2006
ACM
15 years 6 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe