Sciweavers

COMCOM
2008
85views more  COMCOM 2008»
13 years 5 months ago
Efficient placement of proxies for hierarchical reliable multicast
The primary focus of this paper is the design of efficient algorithm for the calculation of solution to the placement of proxies for performance optimization in hierarchical relia...
Liansheng Tan, Li Jin, Yi Pan
CCE
2008
13 years 5 months ago
Differential recurrent neural network based predictive control
An efficient algorithm to train general differential recurrent neural networks is proposed. The trained network can be directly used as the internal model of a predictive controll...
R. K. Al Seyab, Yi Cao
ICML
2010
IEEE
13 years 6 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...
AAAI
2000
13 years 6 months ago
Learning the Common Structure of Data
The proliferation of online information sources has accentuated the need for tools that automatically validate and recognize data. We present an efficient algorithm that learns st...
Kristina Lerman, Steven Minton
UAI
2001
13 years 6 months ago
Efficient Stepwise Selection in Decomposable Models
In this paper, we present an efficient algorithm for performing stepwise selection in the class of decomposable models. We focus on the forward selection procedure, but we also di...
Amol Deshpande, Minos N. Garofalakis, Michael I. J...
DGO
2004
80views Education» more  DGO 2004»
13 years 6 months ago
Temporal Knowledge Discovery with Infrequent Episodes
In this paper, we present an efficient algorithm which discovers rare episodes with a combination of bottomup and top-down scanning schema. The information sharing between bottom-...
Dan Li, Liying Jiang, Jitender S. Deogun
CCCG
2006
13 years 6 months ago
Shortest Descending Paths through Given Faces
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw
ACL
2006
13 years 6 months ago
An Improved Redundancy Elimination Algorithm for Underspecified Representations
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
Alexander Koller, Stefan Thater
ASUNAM
2010
IEEE
13 years 6 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
FSE
2008
Springer
117views Cryptology» more  FSE 2008»
13 years 6 months ago
Efficient Reconstruction of RC4 Keys from Internal States
Abstract. In this paper we present an efficient algorithm for the retrieval of the RC4 secret key, given an internal state. This algorithm is several orders of magnitude faster tha...
Eli Biham, Yaniv Carmeli