Sciweavers

328 search results - page 20 / 66
» Simple Termination Revisited
Sort
View
SIGIR
2012
ACM
13 years 4 months ago
Unsupervised linear score normalization revisited
We give a fresh look into score normalization for merging result-lists, isolating the problem from other components. We focus on three of the simplest, practical, and widelyused l...
Ilya Markov, Avi Arampatzis, Fabio Crestani
158
Voted
AAAI
2012
13 years 4 months ago
The Complexity of Planning Revisited - A Parameterized Analysis
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
Christer Bäckström, Yue Chen, Peter Jons...
174
Voted
CPP
2011
107views more  CPP 2011»
14 years 1 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
IICS
2005
Springer
15 years 7 months ago
Innovation Processes Revisited by Internet
Internet, far from being a simple technology, is truly changing our way of life. Just as the invention of the alphabet, or the printing, Internet is a fundamental technology that w...
Serge Soudoplatoff
114
Voted
STOC
1998
ACM
167views Algorithms» more  STOC 1998»
15 years 6 months ago
An Improved Approximation Algorithm for Multiway Cut
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani