Sciweavers

1301 search results - page 82 / 261
» Bounded Version Vectors
Sort
View
131
Voted
ENTCS
2002
61views more  ENTCS 2002»
15 years 3 months ago
Effectively Absolute Continuity and Effective Jordan Decomposability
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
Xizhong Zheng, Robert Rettinger, Burchard von Brau...
117
Voted
JCT
2002
107views more  JCT 2002»
15 years 3 months ago
Asymmetric Binary Covering Codes
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
159
Voted
SP
2000
IEEE
15 years 8 months ago
A Practically Implementable and Tractable Delegation Logic
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...
Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum
128
Voted
IPCO
2010
160views Optimization» more  IPCO 2010»
15 years 5 months ago
On Column-Restricted and Priority Covering Integer Programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...
111
Voted
ICML
2006
IEEE
16 years 4 months ago
Permutation invariant SVMs
We extend Support Vector Machines to input spaces that are sets by ensuring that the classifier is invariant to permutations of subelements within each input. Such permutations in...
Pannagadatta K. Shivaswamy, Tony Jebara