Sciweavers

1032 search results - page 163 / 207
» Extended Computation Tree Logic
Sort
View
ICPR
2006
IEEE
15 years 11 months ago
Forest Extension of Error Correcting Output Codes and Boosted Landmarks
In this paper, we introduce a robust novel approach for detecting objects category in cluttered scenes by generating boosted contextual descriptors of landmarks. In particular, ou...
Oriol Pujol, Petia Radeva, Sergio Escalera
DCC
2002
IEEE
15 years 9 months ago
Zero-Error Source Coding with Maximum Distortion Criterion
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
Ertem Tuncel, Prashant Koulgi, Shankar L. Regunath...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 7 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...
ICPP
2005
IEEE
15 years 3 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao
CONCUR
2005
Springer
15 years 3 months ago
Selecting Theories and Recursive Protocols
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...
Tomasz Truderung