Sciweavers

10392 search results - page 1668 / 2079
» Introduction to Computer Science
Sort
View
CSIE
2009
IEEE
16 years 7 days ago
K-Means on Commodity GPUs with CUDA
K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for the performance of original algorithms have been put forward, whi...
Hong-tao Bai, Li-li He, Dan-tong Ouyang, Zhan-shan...
ACMACE
2009
ACM
16 years 6 days ago
Familiars: representing Facebook users' social behaviour through a reflective playful experience
In this paper, we describe the design and development of a social game called Familiars. Inspired by the daemons in Pullman’s “Dark Material” trilogy, Familiars are animal c...
Ben Kirman, Eva Ferrari, Shaun Lawson, Jonathan Fr...
215
Voted
SAC
2009
ACM
16 years 5 days ago
An ontology-based application in heart electrophysiology: representation, reasoning and visualization on the web
Computational technologies have been increasingly explored to make biomedical knowledge and data more accessible for human understanding, comparison, analysis and communication. I...
Bernardo Gonçalves, Veruska Zamborlini, Gia...
231
Voted
MFCS
2009
Springer
16 years 2 days ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
GD
2001
Springer
16 years 12 hour ago
Orthogonal Drawings of Plane Graphs without Bends
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki
« Prev « First page 1668 / 2079 Last » Next »