Sciweavers

266 search results - page 23 / 54
» High-Rank Matrix Completion
Sort
View
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 11 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
ICFCA
2009
Springer
14 years 3 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
ISPASS
2005
IEEE
14 years 2 months ago
On the Scalability of 1- and 2-Dimensional SIMD Extensions for Multimedia Applications
SIMD extensions are the most common technique used in current processors for multimedia computing. In order to obtain more performance for emerging applications SIMD extensions ne...
Friman Sánchez, Mauricio Alvarez, Esther Sa...
IMC
2005
ACM
14 years 2 months ago
Combining Filtering and Statistical Methods for Anomaly Detection
In this work we develop an approach for anomaly detection for large scale networks such as that of an enterprize or an ISP. The traffic patterns we focus on for analysis are that...
Augustin Soule, Kavé Salamatian, Nina Taft
IJAR
2007
86views more  IJAR 2007»
13 years 8 months ago
Non-deterministic semantics for logics with a consistency operator
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
Arnon Avron