Sciweavers

995 search results - page 186 / 199
» complexity 2011
Sort
View
CGF
2011
14 years 6 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
CGF
2011
14 years 6 months ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt
119
Voted
CHI
2011
ACM
14 years 6 months ago
When the implication is not to design (technology)
As HCI is applied in increasingly diverse contexts, it is important to consider situations in which computational or information technologies may be less appropriate. This paper p...
Eric P. S. Baumer, M. Six Silberman
CIDR
2011
243views Algorithms» more  CIDR 2011»
14 years 6 months ago
Longitudinal Analytics on Web Archive Data: It's About Time!
Organizations like the Internet Archive have been capturing Web contents over decades, building up huge repositories of time-versioned pages. The timestamp annotations and the she...
Gerhard Weikum, Nikos Ntarmos, Marc Spaniol, Peter...
COMPGEOM
2011
ACM
14 years 6 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...