Sciweavers

1066 search results - page 73 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
MUM
2004
ACM
115views Multimedia» more  MUM 2004»
15 years 3 months ago
Task computing for ubiquitous multimedia services
The Task Computing framework is designed to operate in dynamic ubiquitous environments in which a mobile computing user dynamically discovers the current set of available semantic...
Zhexuan Song, Ryusuke Masuoka, Jonathan R. Agre, Y...
ICCS
2004
Springer
15 years 3 months ago
DisCAS: A Distributed-Parallel Computer Algebra System
The DisCAS system employs and interacts with multiple ELIMINOs distributed over the Internet to achieve a distributed-parallel computing environment. ELIMINO is a computer algebra ...
Yongwei Wu, Guangwen Yang, Weimin Zheng, Dongdai L...
ICPR
2008
IEEE
15 years 4 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
ECAL
2007
Springer
15 years 4 months ago
Turing Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
Anthony M. L. Liekens, Chrisantha Thomas Fernando
WG
2005
Springer
15 years 3 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...