Sciweavers

2715 search results - page 137 / 543
» Total Generalized Variation
Sort
View
CODES
2005
IEEE
15 years 5 months ago
An efficient direct mapped instruction cache for application-specific embedded systems
Caches may consume half of a microprocessor’s total power and cache misses incur accessing off-chip memory, which is both time consuming and energy costly. Therefore, minimizing...
Chuanjun Zhang
ADHOC
2007
101views more  ADHOC 2007»
15 years 3 months ago
Searching strategies for target discovery in wireless networks
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
Zhao Cheng, Wendi B. Heinzelman
JUCS
2008
166views more  JUCS 2008»
15 years 3 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
ORL
2008
73views more  ORL 2008»
15 years 3 months ago
Polytopes and arrangements: Diameter and curvature
By analogy with the conjecture of Hirsch, we conjecture that the order of the largest total curvature of the central path associated to a polytope is the number of inequalities de...
Antoine Deza, Tamás Terlaky, Yuriy Zinchenk...
JGAA
2000
85views more  JGAA 2000»
15 years 2 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....