Sciweavers

5675 search results - page 240 / 1135
» Exploiting Chaos for Computation
Sort
View
ATVA
2007
Springer
90views Hardware» more  ATVA 2007»
15 years 11 months ago
Efficient Approximate Verification of Promela Models Via Symmetry Markers
We present a new verification technique for Promela which exploits state-space symmetries induced by scalarset values used in a model. The technique involves efficiently computing ...
Dragan Bosnacki, Alastair F. Donaldson, Michael Le...
ENTCS
2007
100views more  ENTCS 2007»
15 years 7 months ago
JOLIE: a Java Orchestration Language Interpreter Engine
Service oriented computing is an emerging paradigm for programming distributed applications based on services. Services are simple software elements that supply their functionalit...
Fabrizio Montesi, Claudio Guidi, Roberto Lucchi, G...
FCCM
1998
IEEE
89views VLSI» more  FCCM 1998»
15 years 11 months ago
A Run-Time Reconfigurable Engine for Image Interpolation
Custom Computing Machines (CCM's) have demonstrated significant performance advantages over general-purpose processors for certain classes of problems. However, problems can ...
Rhett D. Hudson, David I. Lehn, Peter M. Athanas
TKDE
2012
250views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
EDBT
2009
ACM
118views Database» more  EDBT 2009»
16 years 2 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin