4128 search results - page 672 / 826 » Learning and using relational theories |
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
FDTC
2006
Springer
15 years 1 months ago
2006
Springer
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
TPHOL
2000
IEEE
15 years 1 months ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
138
Voted
ICCV
1995
IEEE
15 years 1 months ago
1995
IEEE
A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time according to intrinsic geometric measures of the imag...
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...