Sciweavers

1968 search results - page 328 / 394
» The Complexity of Valued Constraint Models
Sort
View
WSDM
2012
ACM
283views Data Mining» more  WSDM 2012»
13 years 5 months ago
The life and death of online groups: predicting group growth and longevity
We pose a fundamental question in understanding how to identify and design successful communities: What factors predict whether a community will grow and survive in the long term?...
Sanjay Ram Kairam, Dan J. Wang, Jure Leskovec
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
15 years 3 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
RT
2004
Springer
15 years 3 months ago
Real-time appearance preserving out-of-core rendering with shadows
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging tas...
Michael Guthe, Pavel Borodin, Ákos Bal&aacu...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
15 years 10 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
15 years 4 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...