Sciweavers

1888 search results - page 235 / 378
» Proof theory and computational analysis
Sort
View
139
Voted
CSR
2007
Springer
15 years 8 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
OZCHI
2006
ACM
15 years 7 months ago
InfoScent evaluator: a semi-automated tool to evaluate semantic appropriateness of hyperlinks in a web site
In this paper, we present InfoScent Evaluator, a tool that automatically evaluates the semantic appropriateness of the descriptions of hyperlinks in web pages. The tool is based o...
Christos Katsanos, Nikolaos K. Tselios, Nikolaos M...
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 5 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
DAC
2010
ACM
15 years 5 months ago
On the costs and benefits of stochasticity in stream processing
With the end of clock-frequency scaling, parallelism has emerged as the key driver of chip-performance growth. Yet, several factors undermine efficient simultaneous use of onchip ...
Raj R. Nadakuditi, Igor L. Markov
ATAL
2008
Springer
15 years 3 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...