Sciweavers

1002 search results - page 103 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
130
Voted
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 8 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
112
Voted
NAACL
2007
15 years 4 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger
116
Voted
WWW
2005
ACM
16 years 3 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
162
Voted
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
15 years 8 months ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
138
Voted
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 8 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert