Sciweavers

2983 search results - page 173 / 597
» The group marriage problem
Sort
View
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
13 years 9 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...
APPROX
2004
Springer
119views Algorithms» more  APPROX 2004»
16 years 10 hour ago
Cost-Sharing Mechanisms for Network Design
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
Anupam Gupta, Aravind Srinivasan, Éva Tardo...
163
Voted
LICS
2002
IEEE
15 years 11 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
142
Voted
COCO
1989
Springer
110views Algorithms» more  COCO 1989»
15 years 10 months ago
The Complexity of Iterated Multiplication
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
Neil Immerman, Susan Landau
AGENTS
2000
Springer
15 years 10 months ago
From one virtual actor to virtual crowds: requirements and constraints
A crowd is not only a group of many individuals. Crowd modelling involves problems that arise only when we focus on crowds. For instance, avoiding collision problems related to a ...
Soraia Raupp Musse, Daniel Thalmann