Sciweavers

2376 search results - page 95 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
ICDE
2006
IEEE
110views Database» more  ICDE 2006»
14 years 9 months ago
Detecting Duplicates in Complex XML Data
Recent work both in the relational and the XML world have shown that the efficacy and efficiency of duplicate detection is enhanced by regarding relationships between entities. Ho...
Melanie Weis, Felix Naumann
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
13 years 11 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht
WSCG
2004
156views more  WSCG 2004»
13 years 9 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
IPPS
1999
IEEE
14 years 2 days ago
The Performance of Coordinated and Independent Checkpointing
Checkpointing is a very effective technique to tolerate the occurrence of failures in distributed and parallel applications. The existing algorithms in the literature are basicall...
Luís Moura Silva, João Gabriel Silva
ECCV
2004
Springer
14 years 9 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...