Sciweavers

934 search results - page 42 / 187
» A theoretical analysis of the HIFF problem
Sort
View
HIPC
2005
Springer
15 years 3 months ago
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
David A. Bader, Kamesh Madduri
ICRA
1999
IEEE
136views Robotics» more  ICRA 1999»
15 years 2 months ago
Analysis and Design of Non-Time Based Motion Controller for Mobile Robots
A new design method for non-time based tracking controller of mobile robots is presented. The new design method converts a controller designed by traditional time-based approaches ...
Wei Kang, Ning Xi, Jindong Tan
COMPGEOM
2006
ACM
15 years 3 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
JMLR
2002
144views more  JMLR 2002»
14 years 9 months ago
Round Robin Classification
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
Johannes Fürnkranz
TPHOL
2005
IEEE
15 years 3 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown