Sciweavers

2661 search results - page 376 / 533
» Quantum Complexity Classes
Sort
View
DCC
2006
IEEE
16 years 3 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
106
Voted
DCC
2006
IEEE
16 years 3 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...
116
Voted
MOBIHOC
2004
ACM
16 years 3 months ago
Error characteristics of ad hoc positioning systems (aps)
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
Dragos Niculescu, Badri Nath
133
Voted

Publication
309views
16 years 23 days ago
Improving Nearest Neighbor Classification with Cam Weighted Distance
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
Changyin Zhou, Yanqiu Chen
149
Voted
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 22 days 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...