Sciweavers

1826 search results - page 299 / 366
» Using Random Forests in the Structured Language Model
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 3 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
FLAIRS
2008
15 years 1 days ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
DGO
2003
111views Education» more  DGO 2003»
14 years 11 months ago
Digital Citizenship: Parameters of the Digital Divide
As part of a National Science Foundation-funded study, we analyze data from a 2002 Midwest urban random sample survey (n = 167 adults) of differential access to and uses of comput...
Stuart W. Shulman, Mack C. Shelley, Lisa Thrane
NIPS
2001
14 years 11 months ago
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
Matthew Richardson, Pedro Domingos
JSYML
2000
103views more  JSYML 2000»
14 years 9 months ago
A Model Complete Theory of Valued D-Fields
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for...
Thomas Scanlon