Sciweavers

2078 search results - page 224 / 416
» Using Aspects to Make Adaptive Object-Models Adaptable
Sort
View
APAL
2008
104views more  APAL 2008»
15 years 6 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
CONCURRENCY
2008
71views more  CONCURRENCY 2008»
15 years 6 months ago
Gossip-based search selection in hybrid peer-to-peer networks
We present GAB, a search algorithm for hybrid P2P networks, that is, networks that search using both flooding and a DHT. GAB uses a gossip-style algorithm to collect global statis...
M. Zaharia, S. Keshav
JNW
2008
149views more  JNW 2008»
15 years 6 months ago
Improving Semantic Web Service Discovery
Semantic Web Services (SWS) propose to extend the traditional Web Services technologies on the way to consolidate ontologies and semantics. This makes it possible to select, integr...
J. Javier Samper, F. Javier Adell, Leo van den Ber...
SI3D
1999
ACM
15 years 10 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
PAMI
2010
205views more  PAMI 2010»
15 years 5 months ago
Learning a Hierarchical Deformable Template for Rapid Deformable Object Parsing
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
Long Zhu, Yuanhao Chen, Alan L. Yuille