Sciweavers

688 search results - page 119 / 138
» The Flow Set with Partial Order
Sort
View
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
AMEC
2004
Springer
14 years 1 months ago
Designing Auctions for Deliberative Agents
Abstract. In many settings, bidding agents for auctions do not know their preferences a priori. Instead, they must actively determine them through deliberation (e.g., information p...
Kate Larson, Tuomas Sandholm
DBPL
1993
Springer
141views Database» more  DBPL 1993»
14 years 18 days ago
Some Properties of Query Languages for Bags
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Leonid Libkin, Limsoon Wong
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 9 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
14 years 19 days ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag