Sciweavers

60 search results - page 2 / 12
» Partitioning multi-dimensional sets in a small number of
Sort
View
RAS
2008
142views more  RAS 2008»
13 years 5 months ago
Motion intention recognition in robot assisted applications
Acquiring, representing and modeling human skills is one of the key research areas in teleoperation, programming-by-demonstration and human-machine collaborative settings. The pro...
Daniel Aarno, Danica Kragic
HSNMC
2004
Springer
172views Multimedia» more  HSNMC 2004»
13 years 11 months ago
Fast Update Algorithm for IP Forwarding Table Using Independent Sets
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao
IM
2007
13 years 6 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
FOCS
2009
IEEE
14 years 27 days ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
DFT
2005
IEEE
132views VLSI» more  DFT 2005»
13 years 8 months ago
Low Power BIST Based on Scan Partitioning
A built-in self-test (BIST) scheme is presented which both reduces overhead for detecting random-pattern-resistant (r.p.r.) faults as well as reduces power consumption during test...
Jinkyu Lee, Nur A. Touba