Sciweavers

642 search results - page 127 / 129
» Probabilistic Models of Verb-Argument Structure
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
15 years 10 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
ECCV
2002
Springer
15 years 11 months ago
Learning to Parse Pictures of People
The detection of people is one of the foremost problems for indexing, browsing and retrieval of video. The main difficulty is the large appearance variations caused by action, clot...
Rémi Ronfard, Cordelia Schmid, Bill Triggs
ICDE
2003
IEEE
247views Database» more  ICDE 2003»
15 years 10 months ago
CLUSEQ: Efficient and Effective Sequence Clustering
Analyzing sequence data has become increasingly important recently in the area of biological sequences, text documents, web access logs, etc. In this paper, we investigate the pro...
Jiong Yang, Wei Wang 0010
EUROSYS
2008
ACM
15 years 6 months ago
Samurai: protecting critical data in unsafe languages
Programs written in type-unsafe languages such as C and C++ incur costly memory errors that result in corrupted data structures, program crashes, and incorrect results. We present...
Karthik Pattabiraman, Vinod Grover, Benjamin G. Zo...
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...