920 search results - page 100 / 184 » Accurate Step Counting |
145
click to vote
ADC
2003
Springer
15 years 7 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
121
click to vote
VISUALIZATION
2002
IEEE
15 years 6 months ago
2002
IEEE
We present a robust, noise-resistant criterion characterizing planelike skeletons in binary voxel objects. It is based on a distance map and the geodesic distance along the object...
135
Voted
KR
2010
Springer
15 years 6 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
136
click to vote
WDAG
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
126
click to vote
CIKM
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...