Sciweavers

11213 search results - page 426 / 2243
» Low-contention data structures
Sort
View
NIPS
2004
15 years 8 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
230
Voted
RIAO
2000
15 years 8 months ago
SgmlQL + XGQL = Powerful XML Pattern-Matching and Data-Manipulation in a Single Language
The presence of XML in many recent hypermedia management tools and methods (W3I3, SMIL, etc.) shows better than ever that both structural and textual criteria will continue to pla...
Jacques Le Maitre, Yves Marcoux, Elisabeth Murisas...
SYNTHESE
2008
112views more  SYNTHESE 2008»
15 years 6 months ago
A sufficient condition for pooling data
We consider the problems arising from using sequences of experiments to discover the causal structure among a set of variables, none of whom are known ahead of time to be an "...
Frederick Eberhardt
CIKM
2009
Springer
16 years 1 months ago
Annotating wikipedia articles with semantic tags for structured retrieval
Structured retrieval aims at exploiting the structural information of documents when searching for documents. Structured retrieval makes use of both content and structure of docum...
Saravadee Sae Tan, Tang Enya Kong, Gian Chand Sodh...
ICICS
2009
Springer
16 years 1 months ago
Security Analysis of the GF-NLFSR Structure and Four-Cell Block Cipher
The overall structure is one of the most important properties of block ciphers. At present, the most common structures include Feistel structure, SP structure, MISTY structure, L-M...
Wenling Wu, Lei Zhang, Liting Zhang, Wentao Zhang