Sciweavers

257 search results - page 28 / 52
» Computability over The Partial Continuous Functionals
Sort
View
SSDBM
2008
IEEE
181views Database» more  SSDBM 2008»
14 years 4 months ago
Monitoring Aggregate k-NN Objects in Road Networks
Abstract. In recent years, there is an increasing need to monitor k nearest neighbor (k-NN) in a road network. There are existing solutions on either monitoring k-NN objects from a...
Lu Qin, Jeffrey Xu Yu, Bolin Ding, Yoshiharu Ishik...
CAD
2004
Springer
13 years 9 months ago
A shape design system using volumetric implicit PDEs
Solid modeling based on partial differential equations (PDEs) can potentially unify both geometric constraints and functional requirements within a single design framework to mode...
Haixia Du, Hong Qin
ICCV
2011
IEEE
12 years 10 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
ECML
2003
Springer
14 years 3 months ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
CONCURRENCY
2004
93views more  CONCURRENCY 2004»
13 years 9 months ago
Studying protein folding on the Grid: experiences using CHARMM on NPACI resources under Legion
-- One of the benefits of a computational grid is the ability to run high-performance applications over distributed resources simply and securely. We demonstrated this benefit with...
Anand Natrajan, Michael Crowley, Nancy Wilkins-Die...