Sciweavers

7773 search results - page 220 / 1555
» On generalized Frame-Stewart numbers
Sort
View
ATAL
2009
Springer
16 years 1 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
CANDC
2009
ACM
16 years 1 months ago
Subliminal wiretapping
Subliminal Wiretapping is a subtly interactive artwork that utilizes random number generation modified through mindmatter effects to supply a continuous stream of words. Frequent,...
Shawn Lawson
COCOA
2007
Springer
16 years 20 days ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
FSTTCS
2009
Springer
15 years 11 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
15 years 11 months ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra