Sciweavers

369 search results - page 23 / 74
» Fast Algorithms for the Generalized Foley-Sammon Discriminan...
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast 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-s...
Donghui Yan, Ling Huang, Michael I. Jordan
PODC
2009
ACM
14 years 2 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
ASPLOS
2000
ACM
13 years 12 months ago
Architectural Support for Fast Symmetric-Key Cryptography
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
Jerome Burke, John McDonald, Todd M. Austin
ACCV
2006
Springer
14 years 1 months ago
Probabilistic Modeling for Structural Change Inference
We view the task of change detection as a problem of object recognition from learning. The object is defined in a 3D space where the time is the 3rd dimension. We propose two com...
Wei Liu, Véronique Prinet
IROS
2006
IEEE
171views Robotics» more  IROS 2006»
14 years 1 months ago
Fast central catadioptric line extraction, estimation, tracking and structure from motion
— In this paper we present an analysis of 3D line projections for central catadioptric cameras from a projective perspective. Most algorithms consider the projection of lines as ...
Christopher Mei, Ezio Malis