Sciweavers

3663 search results - page 391 / 733
» Problems in the ontology of computer programs
Sort
View
ICALP
2004
Springer
16 years 5 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
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
DAC
2003
ACM
16 years 7 months ago
Extending the lifetime of a network of battery-powered mobile devices by remote processing: a markovian decision-based approach
This paper addresses the problem of extending the lifetime of a batterypowered mobile host in a client-server wireless network by using task migration and remote processing. This ...
Peng Rong, Massoud Pedram
CHI
2001
ACM
16 years 7 months ago
Locus of feedback control in computer-based tutoring: impact on learning rate, achievement and attitudes
The advent of second-generation intelligent computer tutors raises an important instructional design question: when should tutorial advice be presented in problem solving? This pa...
Albert T. Corbett, John R. Anderson
INFOCOM
2006
IEEE
16 years 25 days ago
Trade-Off Curves for QoS Routing
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
Piet Van Mieghem, Lieven Vandenberghe