187 search results - page 31 / 38 » Computing Special Values of Partial Zeta Functions |
94
Voted
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
CHI
1999
ACM
15 years 1 months ago
1999
ACM
The past decades have seen huge improvements in computer systems but these have proved difficult to translate into comparable improvements in the usability and social integration)...
120
click to vote
SCALESPACE
2007
Springer
15 years 3 months ago
2007
Springer
Level set methods have been proven to be efficient tools for tracing interface problems. Recently, some variants of the Osher- Sethian level set methods, which are called the Piece...
VLDB
1998
ACM
15 years 1 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of estimating the 3D shape and reflectance properties of an object made of a single material from a calibrated set of multiple views. To model reflectance, ...