Sciweavers

1552 search results - page 251 / 311
» On the Complexity of Constant Propagation
Sort
View
IANDC
2007
151views more  IANDC 2007»
15 years 6 months ago
Transducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
Ralf Küsters, Thomas Wilke
PE
2006
Springer
107views Optimization» more  PE 2006»
15 years 6 months ago
Efficient steady-state analysis of second-order fluid stochastic Petri nets
This paper presents an efficient solution technique for the steady-state analysis of the second-order Stochastic Fluid Model underlying a second-order Fluid Stochastic Petri Net (...
Marco Gribaudo, Rossano Gaeta
JGT
2007
99views more  JGT 2007»
15 years 6 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
15 years 6 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 6 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...