Sciweavers

11160 search results - page 228 / 2232
» Incompleteness in a General Setting
Sort
View
DCC
2004
IEEE
16 years 5 months ago
LDPC Codes from Triangle-Free Line Sets
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
Keith E. Mellinger
WASA
2009
Springer
165views Algorithms» more  WASA 2009»
16 years 10 days ago
Maximum Independent Set of Links under Physical Interference Model
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
Peng-Jun Wan, Xiaohua Jia, F. Frances Yao
ISNN
2009
Springer
16 years 9 days ago
Nonlinear Component Analysis for Large-Scale Data Set Using Fixed-Point Algorithm
Abstract. Nonlinear component analysis is a popular nonlinear feature extraction method. It generally uses eigen-decomposition technique to extract the principal components. But th...
Weiya Shi, Yue-Fei Guo
KR
2010
Springer
15 years 10 months ago
Set-Oriented Logical Connectives: Syntax and Semantics
Of the common commutative binary logical connectives, only and and or may be used as operators that take arbitrary numbers of arguments with order and multiplicity being irrelevan...
Stuart C. Shapiro
ICDT
2007
ACM
74views Database» more  ICDT 2007»
15 years 9 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu