Sciweavers

548 search results - page 108 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
COLING
2002
14 years 11 months ago
The LinGO Redwoods Treebank: Motivation and Preliminary Applications
The LinGO Redwoods initiative is a seed activity in the design and development of a new type of treebank. While several medium- to large-scale treebanks exist for English (and for...
Stephan Oepen, Kristina Toutanova, Stuart M. Shieb...
FCSC
2010
238views more  FCSC 2010»
14 years 9 months ago
Knowledge discovery through directed probabilistic topic models: a survey
Graphical models have become the basic framework for topic based probabilistic modeling. Especially models with latent variables have proved to be effective in capturing hidden str...
Ali Daud, Juanzi Li, Lizhu Zhou, Faqir Muhammad
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 4 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 4 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ISCAPDCS
2001
15 years 29 days ago
End-user Tools for Application Performance Analysis Using Hardware Counters
One purpose of the end-user tools described in this paper is to give users a graphical representation of performance information that has been gathered by instrumenting an applica...
Kevin S. London, Jack Dongarra, Shirley Moore, Phi...