Sciweavers

1763 search results - page 25 / 353
» Dependent random choice
Sort
View
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
14 years 2 months ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
COGSCI
2010
108views more  COGSCI 2010»
13 years 9 months ago
Do Grammars Minimize Dependency Length?
A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for de...
Daniel Gildea, David Temperley
EMNLP
2008
13 years 10 months ago
A Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing
Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both appr...
Yue Zhang 0004, Stephen Clark
RTSS
2002
IEEE
14 years 1 months ago
State-Dependent Deadline Scheduling
This paper presents a new workload model, called the state-dependent deadline model, for applications whose high-level timing requirements may change with time. The problem is how...
Chi-Sheng Shih, Jane W.-S. Liu
FPGA
2004
ACM
234views FPGA» more  FPGA 2004»
14 years 22 days ago
An embedded true random number generator for FPGAs
Field Programmable Gate Arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. Until recently, designers using FPGAs had le...
Paul Kohlbrenner, Kris Gaj