Sciweavers

11151 search results - page 2214 / 2231
» On the Complexity of Model Expansion
Sort
View
LATINCRYPT
2010
13 years 6 months ago
Mediated Traceable Anonymous Encryption
the full version of the extended abstract which appears in Latincrypt '10 (august 8-11, 2010, Puebla, Mexico) M. Abdalla and P. Barreto Eds., Springer-Verlag, LNCS 6212, pages...
Malika Izabachène, David Pointcheval, Damie...
PAMI
2010
222views more  PAMI 2010»
13 years 5 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
PKDD
2010
Springer
188views Data Mining» more  PKDD 2010»
13 years 5 months ago
Semi-supervised Abstraction-Augmented String Kernel for Multi-level Bio-Relation Extraction
ervised Abstraction-Augmented String Kernel for Multi-Level Bio-Relation Extraction Pavel Kuksa1 , Yanjun Qi2 , Bing Bai2 , Ronan Collobert2 , Jason Weston3 , Vladimir Pavlovic1 , ...
Pavel P. Kuksa, Yanjun Qi, Bing Bai, Ronan Collobe...
PVLDB
2010
129views more  PVLDB 2010»
13 years 5 months ago
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey ...
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 5 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman
« Prev « First page 2214 / 2231 Last » Next »