Sciweavers

7351 search results - page 1097 / 1471
» Segmenting Point Sets
Sort
View
PERCOM
2008
ACM
16 years 6 months ago
Towards Robust Low Cost Authentication for Pervasive Devices
Low cost devices such as RFIDs, sensor network nodes, and smartcards are crucial for building the next generation pervasive and ubiquitous networks. The inherent power and footpri...
Erdinç Öztürk, Ghaith Hammouri, B...
PERCOM
2005
ACM
16 years 6 months ago
PICASSO: Pervasive Information Chronicling, Access, Search, and Sharing for Organizations
Several researchers have pointed out and begun to demonstrate that it is now possible to digitize an entire lifetime of experiences into a pocket-sized storage device, and thus to...
Gopal Pingali, Mark Podlaseck, Sinem Güven
DCC
2005
IEEE
16 years 6 months ago
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
Pascale Charpin, Enes Pasalic
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 4 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 4 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
« Prev « First page 1097 / 1471 Last » Next »