Sciweavers

5169 search results - page 224 / 1034
» Locality approximation using time
Sort
View
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
16 years 19 days ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
SIGMOD
1996
ACM
131views Database» more  SIGMOD 1996»
15 years 10 months ago
Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...
Kenneth A. Ross, Divesh Srivastava, S. Sudarshan
SIGMETRICS
2010
ACM
201views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
Load balancing via random local search in closed and open systems
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
Ayalvadi Ganesh, Sarah Lilienthal, D. Manjunath, A...
ICIP
2006
IEEE
16 years 8 months ago
Generalized Histogram Equalization Based on Local Characteristics
From time to time, state-of-the-art contrast enhancement algorithms face undesired drawbacks, like loss of tiny details, enhancement of image noise, occasional overenhancement, an...
Tzu-Cheng Jen, Sheng-Jyh Wang
ICS
2007
Tsinghua U.
16 years 22 days ago
Locality of sampling and diversity in parallel system workloads
Observing the workload on a computer system during a short (but not too short) time interval may lead to distributions that are significantly different from those that would be o...
Dror G. Feitelson