Sciweavers

3227 search results - page 112 / 646
» Designing with Distance Fields
Sort
View
CHI
2009
ACM
14 years 11 months ago
Supporting carers in their caring role through design
Carers are people who look after family, partners or friends who could not manage without them because of frailness, illness or disability. Our contribution is to show the potenti...
Andrea Taylor, Richard Wilson, Stefan Agamanolis
AAAI
2010
13 years 12 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
ICPR
2008
IEEE
14 years 11 months ago
Separability of ternary Error-Correcting Output Codes
Error Correcting Output Codes (ECOC) represent a successful framework to deal with multi-class categorization problems based on combining binary classifiers. In this paper, we pre...
Oriol Pujol, Petia Radeva, Sergio Escalera
CAINE
2001
13 years 11 months ago
Towards On-line and Personalized Learning - A Web-Search Engine Utility
Distance learning gives benefits for training organization, which are further enhanced by using new information and communication technology. Computerbased tools provide a solutio...
Sabine Leroy, Hervé Camus, M. Picavet
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 8 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha