3220 search results - page 584 / 644 » Constrained Graph Processes |
158
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
138
click to vote
DAC
2010
ACM
15 years 10 months ago
2010
ACM
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
169
click to vote
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
178
click to vote
ESWS
2006
Springer
15 years 9 months ago
2006
Springer
Classifications have been used for centuries with the goal of cataloguing and searching large sets of objects. In the early days it was mainly books; lately it has also become Web ...
162
click to vote
PKC
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...