Sciweavers

1066 search results - page 97 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
JSAI
2007
Springer
16 years 11 days ago
Towards a Logical Reconstruction of CF-Induction
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
Yoshitaka Yamamoto, Oliver Ray, Katsumi Inoue
IPL
2007
125views more  IPL 2007»
15 years 6 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
135
Voted
ICIP
2006
IEEE
16 years 7 months ago
Developing an Efficient Region Growing Engine for Image Segmentation
Image segmentation is a crucial part of image processing applications. Currently available approaches require significant computer power to handle large images. We present an effi...
Emanuel Gofman
161
Voted
INFOCOM
2002
IEEE
15 years 11 months ago
A Framework for Optimal Battery Management for Wireless Nodes
The focus of this paper is to extend the lifetime of a battery powered node in wireless context. The lifetime of a battery depends on both the manner of discharge and the transmis...
Maria Adamou, Saswati Sarkar
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
15 years 7 months ago
A point-placement strategy for conforming Delaunay tetrahedralization
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Michael Murphy, David M. Mount, Carl W. Gable