Sciweavers

1434 search results - page 245 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
SMA
1993
ACM
107views Solid Modeling» more  SMA 1993»
13 years 11 months ago
Relaxed parametric design with probabilistic constraints
: Parametric design is an important modeling paradigm in computer aided design. Relationships (constraints) between the degrees of freedom (DOFs) of the model, instead of the DOFs ...
Yacov Hel-Or, Ari Rappoport, Michael Werman
ALGOSENSORS
2006
Springer
13 years 11 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
AAAI
2008
13 years 10 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
ICSAP
2010
13 years 9 months ago
Tamper Proofing 3D Models
- This paper describes a novel algorithm designed for tamper proofing of 3D models. Fragile watermarking is a known technique for detecting location of tamper in the artwork. Howev...
Mukesh C. Motwani, Balaji Sridharan, Rakhi C. Motw...
SDM
2007
SIAM
73views Data Mining» more  SDM 2007»
13 years 9 months ago
Sketching Landscapes of Page Farms
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
Bin Zhou 0002, Jian Pei