Sciweavers

948 search results - page 115 / 190
» What can we achieve by arbitrary announcements
Sort
View
SMA
2009
ACM
141views Solid Modeling» more  SMA 2009»
14 years 1 months ago
Robust principal curvatures using feature adapted integral invariants
Principal curvatures and principal directions are fundamental local geometric properties. They are well defined on smooth surfaces. However, due to the nature as higher order di...
Yu-Kun Lai, Shi-Min Hu, Tong Fang
SIGGRAPH
2010
ACM
14 years 1 months ago
Apparent display resolution enhancement for moving images
Limited spatial resolution of current displays makes the depiction of very fine spatial details difficult. This work proposes a novel method applied to moving images that takes ...
Piotr Didyk, Elmar Eisemann, Tobias Ritschel, Karo...
COLT
2008
Springer
13 years 10 months ago
Dimension and Margin Bounds for Reflection-invariant Kernels
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
Thorsten Doliwa, Michael Kallweit, Hans-Ulrich Sim...
HPDC
2002
IEEE
14 years 1 months ago
A Scalable QoS-Aware Service Aggregation Model for Peer-to-Peer Computing Grids
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These syste...
Xiaohui Gu, Klara Nahrstedt
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
13 years 10 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...