Sciweavers

308 search results - page 33 / 62
» How Fast Is the k-Means Method
Sort
View
ATAL
2008
Springer
15 years 5 months ago
Optimized algorithms for multi-agent routing
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
Akihiro Kishimoto, Nathan R. Sturtevant
247
Voted
FAST
2011
14 years 7 months ago
Making the Common Case the Only Case with Anticipatory Memory Allocation
We present Anticipatory Memory Allocation (AMA), a new method to build kernel code that is robust to memoryallocation failures. AMA avoids the usual difficulties in handling allo...
Swaminathan Sundararaman, Yupu Zhang, Sriram Subra...
106
Voted
ICCAD
1998
IEEE
130views Hardware» more  ICCAD 1998»
15 years 7 months ago
GPCAD: a tool for CMOS op-amp synthesis
We present a method for optimizing and automating component and transistor sizing for CMOS operational amplifiers. We observe that a wide variety of performance measures can be fo...
Maria del Mar Hershenson, Stephen P. Boyd, Thomas ...
164
Voted
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
14 years 10 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke
ICCV
2001
IEEE
16 years 5 months ago
Very High Accuracy Velocity Estimation using Orientation Tensors Parametric Motion and Simultaneous Segmentation of the Motion F
In [10] we presented a new velocity estimation algorithm, using orientation tensors and parametric motion models to provide both fast and accurate results. One of the tradeoffs be...
Gunnar Farnebäck