Sciweavers

490 search results - page 41 / 98
» Practical Extensions to the IFDS Algorithm
Sort
View
FPGA
2003
ACM
125views FPGA» more  FPGA 2003»
14 years 2 months ago
I/O placement for FPGAs with multiple I/O standards
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
Wai-Kei Mak
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 6 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
IROS
2008
IEEE
126views Robotics» more  IROS 2008»
14 years 3 months ago
High-dimensional underactuated motion planning via task space control
Abstract— Kinodynamic planning algorithms have the potential to find feasible control trajectories which accomplish a task even in very nonlinear or constrained dynamical system...
Alexander C. Shkolnik, Russ Tedrake
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
14 years 2 months ago
TSP: Mining Top-K Closed Sequential Patterns
Sequential pattern mining has been studied extensively in data mining community. Most previous studies require the specification of a minimum support threshold to perform the min...
Petre Tzvetkov, Xifeng Yan, Jiawei Han
JMLR
2006
93views more  JMLR 2006»
13 years 9 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg