Sciweavers

4313 search results - page 325 / 863
» Using time travel to diagnose computer problems
Sort
View
PRL
2010
188views more  PRL 2010»
15 years 2 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
202
Voted
ICPR
2006
IEEE
16 years 8 months ago
Box-like Superquadric Recovery in Range Images by Fusing Region and Boundary Information
This work contributes to the robotic bin-picking problem, and more specifically to the problem of localizing piled box-like objects. We employ range imagery, and use box-like Supe...
Dimitrios I. Kosmopoulos, Dimitrios Katsoulas
210
Voted
ICCV
2007
IEEE
16 years 1 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
SPAA
2004
ACM
16 years 28 days ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
FOCS
2007
IEEE
16 years 1 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx