Sciweavers

256 search results - page 50 / 52
» Separation of NP-Completeness Notions
Sort
View
DATAMINE
2007
110views more  DATAMINE 2007»
13 years 6 months ago
The complexity of non-hierarchical clustering with instance and cluster level constraints
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
Ian Davidson, S. S. Ravi
JSA
2008
108views more  JSA 2008»
13 years 6 months ago
A methodology to design arbitrary failure detectors for distributed protocols
Nowadays, there are many protocols able to cope with process crashes, but, unfortunately, a process crash represents only a particular faulty behavior. Handling tougher failures (...
Roberto Baldoni, Jean-Michel Hélary, Sara T...
FUIN
2007
135views more  FUIN 2007»
13 years 6 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
IANDC
2007
152views more  IANDC 2007»
13 years 6 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
TIT
2008
92views more  TIT 2008»
13 years 6 months ago
Successive Refinement for Hypothesis Testing and Lossless One-Helper Problem
Abstract--We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H0 : PXY against H1 : PXPY ...
Chao Tian, Jun Chen