1604 search results - page 315 / 321 » Regularization on Discrete Spaces |
COMPGEOM
2003
ACM
14 years 24 days ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
SIGMOD
2010
ACM
14 years 11 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
CIKM
2009
Springer
14 years 5 days ago
2009
Springer
The ability to deal with uncertain information is becoming increasingly important for modern database applications. Whereas a conventional (certain) object is usually represented ...
DIGITALCITIES
2001
Springer
14 years 1 days ago
2001
Springer
Much thinking about digital cities is in terms of community groups. Yet, the world is composed of social networks and not of groups. This paper traces how communities have changed ...
KDD
1999
ACM
13 years 11 months ago
1999
ACM
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...