Sciweavers

16091 search results - page 3150 / 3219
» Solving
Sort
View
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 7 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
EDBT
2010
ACM
181views Database» more  EDBT 2010»
13 years 7 months ago
Private record matching using differential privacy
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, Eli...
ESWS
2010
Springer
13 years 7 months ago
The Semantic Gap of Formalized Meaning
Recent work in Ontology learning and Text mining has mainly focused on engineering methods to solve practical problem. In this thesis, we investigate methods that can substantially...
Sebastian Hellmann
FOCM
2010
108views more  FOCM 2010»
13 years 7 months ago
Iterative Thresholding Meets Free-Discontinuity Problems
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
Massimo Fornasier, Rachel Ward
ICASSP
2010
IEEE
13 years 7 months ago
A symmetric adaptive algorithm for speeding-up consensus
Performing distributed consensus in a network has been an important research problem for several years, and is directly applicable to sensor networks, autonomous vehicle formation...
Daniel Thai, Elizabeth Bodine-Baron, Babak Hassibi
« Prev « First page 3150 / 3219 Last » Next »