Sciweavers

3204 search results - page 413 / 641
» The Alcuin Number of a Graph
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
15 years 11 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
SOFSEM
1997
Springer
15 years 11 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
ASPDAC
2007
ACM
101views Hardware» more  ASPDAC 2007»
15 years 11 months ago
Core-Based Testing of Multiprocessor System-on-Chips Utilizing Hierarchical Functional Buses
Abstract--An integrated test scheduling methodology for multiprocessor System-on-Chips (SOC) utilizing the functional buses for test data delivery is described. The proposed method...
Fawnizu Azmadi Hussin, Tomokazu Yoneda, Alex Orail...
ADMA
2008
Springer
89views Data Mining» more  ADMA 2008»
15 years 9 months ago
Timeline Analysis of Web News Events
With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The w...
Jiangtao Qiu, Chuan Li, Shaojie Qiao, Taiyong Li, ...