Sciweavers

1147 search results - page 198 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
MFCS
2005
Springer
14 years 1 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
CVPR
2010
IEEE
13 years 9 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
MASCOTS
2010
13 years 9 months ago
Efficient Discovery of Loop Nests in Execution Traces
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...
Qiang Xu, Jaspal Subhlok, Nathaniel Hammen
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 7 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
CORR
2007
Springer
160views Education» more  CORR 2007»
13 years 7 months ago
On the Correlation of Geographic and Network Proximity at Internet Edges and its Implications for Mobile Unicast and Multicast R
Signicant eort has been invested recently to accelerate handover operations in a next generation mobile Internet. Corresponding works for developing ecient mobile multicast man...
Thomas C. Schmidt, Matthias Wählisch, Ying Zh...