Sciweavers

2489 search results - page 479 / 498
» On the Subgroup Distance Problem
Sort
View
EGH
2003
Springer
14 years 18 days ago
Automatic shader level of detail
Current graphics hardware can render procedurally shaded objects in real-time. However, due to resource and performance limitations, interactive shaders can not yet approach the c...
Marc Olano, Bob Kuehne, Maryann Simmons
ICNP
2002
IEEE
14 years 10 days ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
COMPGEOM
2010
ACM
14 years 6 days ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
14 years 6 days ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
ICAISC
2010
Springer
14 years 5 days ago
A New Implementation of the co-VAT Algorithm for Visual Assessment of Clusters in Rectangular Relational Data
This paper presents a new implementation of the co-VAT algorithm. We assume we have an m × n matrix D, where the elements of D are pair-wise dissimilarities between m row objects ...
Timothy C. Havens, James C. Bezdek, James M. Kelle...