Sciweavers

9997 search results - page 271 / 2000
» The case for crowd computing
Sort
View
WADS
2007
Springer
113views Algorithms» more  WADS 2007»
16 years 21 days ago
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans R...
CSFW
2005
IEEE
16 years 7 days ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
ARCS
2005
Springer
16 years 4 days ago
A File System for System Programming in Ubiquitous Computing
In Ubiquitous computing small embedded sensor and computing nodes are the main enabling technologies. System programming for such small embedded systems is a challenging task invol...
Christian Decker, Michael Beigl, Albert Krohn
CIE
2005
Springer
16 years 4 days ago
A Network Model of Analogue Computation over Metric Algebras
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...
J. V. Tucker, Jeffery I. Zucker
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
16 years 3 days ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng