Sciweavers

17789 search results - page 3393 / 3558
» Exceptional Use Cases
Sort
View
146
Voted
ICALP
2007
Springer
15 years 10 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
ICS
2007
Tsinghua U.
15 years 10 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
IPSN
2007
Springer
15 years 10 months ago
Robust message-passing for statistical inference in sensor networks
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...
Jeremy Schiff, Dominic Antonelli, Alexandros G. Di...
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
15 years 10 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
115
Voted
IWANN
2007
Springer
15 years 10 months ago
Towards the Integration of a Bioprofile in Ocular Melanoma
Approximately 50% of all patients with intraocular melanoma die of metastatic disease, despite successful treatment of the primary tumour. The main factors associated with mortalit...
Azzam F. Taktak, Antonio Eleuteri, Christian Setzk...
« Prev « First page 3393 / 3558 Last » Next »