Sciweavers

1218 search results - page 185 / 244
» The many facets of natural computing
Sort
View
ECCC
2011
223views ECommerce» more  ECCC 2011»
14 years 6 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
TMI
2010
155views more  TMI 2010»
14 years 6 months ago
Tubular Surface Segmentation for Extracting Anatomical Structures From Medical Imagery
Abstract--This work provides a model for tubular structures, and devises an algorithm to automatically extract tubular anatomical structures from medical imagery. Our model fits ma...
Vandana Mohan, Ganesh Sundaramoorthi, Allen Tannen...
PODC
2011
ACM
14 years 2 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 2 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
AGP
2003
IEEE
15 years 3 months ago
Advanced Backjumping Techniques for Rule Instantiations
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...
Simona Perri, Francesco Scarcello