Sciweavers

27 search results - page 4 / 6
» Polynomial Methods for Allocating Complex Components
Sort
View
SPIN
2000
Springer
13 years 9 months ago
Communication Topology Analysis for Concurrent Programs
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
Matthieu Martel, Marc Gengler
AAAI
2004
13 years 7 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
DCC
2001
IEEE
14 years 5 months ago
Compression of the Layered Depth Image
A layered depth image (LDI) is a new popular representation and rendering method for objects with complex geometries. Similar to a 2D image, the LDI consists of an array of pixels...
Jiangang Duan, Jin Li
PKC
2009
Springer
102views Cryptology» more  PKC 2009»
14 years 6 months ago
A Practical Key Recovery Attack on Basic TCHo
TCHo is a public key encryption scheme based on a stream cipher component, which is particular suitable for low cost devices like RFIDs. In its basic version, TCHo offers no IND-CC...
Mathias Herrmann, Gregor Leander
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
13 years 9 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha