Sciweavers

5995 search results - page 1145 / 1199
» Algorithmic Game Theory
Sort
View
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
15 years 10 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
WWW
2010
ACM
15 years 8 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
WWW
2010
ACM
15 years 8 months ago
DSNotify: handling broken links in the web of data
The Web of Data has emerged as a way of exposing structured linked data on the Web. It builds on the central building blocks of the Web (URIs, HTTP) and benefits from its simplic...
Niko Popitsch, Bernhard Haslhofer
STACS
2010
Springer
15 years 8 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 8 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
« Prev « First page 1145 / 1199 Last » Next »