Sciweavers

2031 search results - page 57 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ISLPED
1997
ACM
96views Hardware» more  ISLPED 1997»
15 years 1 months ago
Re-mapping for low power under tight timing constraints
In this paper1 we propose a novel approach to synthesis for low power under tight timing constraints. Starting from a mapped netlist, we apply a powerful generalized matching algo...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
ECOWS
2006
Springer
15 years 1 months ago
On the Evaluation of Semantic Web Service Matchmaking Systems
Semantic Web Services are generally considered as the evolution of conventional Web Services. Semantic information included in the service descriptions enables the development of ...
Vassileios Tsetsos, Christos Anagnostopoulos, Stat...
RECOMB
1998
Springer
15 years 2 months ago
Alignments without low-scoring regions
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
Zheng Zhang 0004, Piotr Berman, Webb Miller
LREC
2008
90views Education» more  LREC 2008»
14 years 11 months ago
Navigating through Dense Annotation Spaces
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories--the common representati...
Branimir Boguraev, Mary S. Neff
SGP
2003
14 years 11 months ago
Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
One of the challenges in 3D shape matching arises from the fact that in many applications, models should be considered to be the same if they differ by a rotation. Consequently, w...
Michael M. Kazhdan, Thomas A. Funkhouser, Szymon R...