Sciweavers

10608 search results - page 1812 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
100
Voted
ERCIMDL
1999
Springer
117views Education» more  ERCIMDL 1999»
15 years 4 months ago
Predicting Indexer Performance in a Distributed Digital Library
Resource discovery in a distributed digital library poses many challenges, one of which is how to choose search engines for query distribution, given a query and a set of search e...
Naomi Dushay, James C. French, Carl Lagoze
CA
1998
IEEE
15 years 4 months ago
Feature-based Surface Decomposition for Correspondence and Morphing Between Polyhedra
We present a new approach for establishing correspondence between two homeomorphic 3D polyhedral models. The user can specify corresponding feature pairs on the polyhedra with a s...
Arthur D. Gregory, Andrei State, Ming C. Lin, Dine...
95
Voted
ICIAP
1999
ACM
15 years 4 months ago
Bayesian Graph Edit Distance
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
Richard Myers, Richard C. Wilson, Edwin R. Hancock
139
Voted
ICVS
1999
Springer
15 years 4 months ago
Face-Tracking and Coding for Video Compression
While computing power and transmission bandwidth have both been steadily increasing over the last few years, bandwidth rather than processing power remains the primary bottleneck f...
William E. Vieux, Karl Schwerdt, James L. Crowley
99
Voted
ICNP
1998
IEEE
15 years 4 months ago
On Reducing the Processing Cost of On-Demand QoS Path Computation
Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network...
George Apostolopoulos, Satish K. Tripathi
« Prev « First page 1812 / 2122 Last » Next »