Sciweavers

14078 search results - page 301 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
ICALP
2004
Springer
16 years 1 days ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
CVPR
2005
IEEE
16 years 8 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
HICSS
2005
IEEE
146views Biometrics» more  HICSS 2005»
16 years 8 days ago
Maintaining Continuous Dependability in Sensor-Based Context-Aware Pervasive Computing Systems
Sensors are often indicative of events of interest, or events which a system should be aware of and should react to. In particular, such indications may reflect unsteadiness or in...
Amir Padovitz, Arkady B. Zaslavsky, Seng Wai Loke,...
IEEEICCI
2006
IEEE
16 years 21 days ago
SenseNet: A Knowledge Representation Model for Computational Semantics
Knowledge representation is essential for semantics modeling and intelligent information processing. For decades researchers have proposed many knowledge representation techniques...
Ping Chen, Wei Ding 0003, Chengmin Ding
SIGCSE
2009
ACM
135views Education» more  SIGCSE 2009»
16 years 7 months ago
Breadth-last technical electives: integrating the CS core via computer games and mobile robotics
In this paper, we introduce the concept of breadth-last technical elective courses, which are designed to assist undergraduate CS students in integrating their entire core curricu...
William W. White, Jerry B. Weinberg