Sciweavers

2631 search results - page 114 / 527
» A Practical Method for the Sparse Resultant
Sort
View
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
15 years 11 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly
CC
2003
Springer
126views System Software» more  CC 2003»
15 years 11 months ago
Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms
Abstract. Offset assignment is a highly effective DSP address code optimization technique that has been implemented in a number of ANSI C compilers. In this paper we concentrate on...
Rainer Leupers
TAMC
2007
Springer
16 years 11 days ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
FC
2005
Springer
99views Cryptology» more  FC 2005»
15 years 11 months ago
Countering Identity Theft Through Digital Uniqueness, Location Cross-Checking, and Funneling
One of today’s fastest growing crimes is identity theft – the unauthorized use and exploitation of another individual’s identitycorroborating information. It is exacerbated b...
Paul C. van Oorschot, Stuart G. Stubblebine
DSMML
2004
Springer
15 years 11 months ago
Extensions of the Informative Vector Machine
The informative vector machine (IVM) is a practical method for Gaussian process regression and classification. The IVM produces a sparse approximation to a Gaussian process by com...
Neil D. Lawrence, John C. Platt, Michael I. Jordan