Sciweavers

2526 search results - page 81 / 506
» A New Algorithm for Answer Set Computation
Sort
View
CVPR
2008
IEEE
16 years 7 months ago
FuzzyMatte: A computationally efficient scheme for interactive matting
In this paper, we propose an online interactive matting algorithm, which we call FuzzyMatte. Our framework is based on computing the fuzzy connectedness (FC) [20] from each unknow...
Yuanjie Zheng, Chandra Kambhamettu, Jingyi Yu, Tho...
ICCAD
2003
IEEE
194views Hardware» more  ICCAD 2003»
16 years 1 months ago
On the Interaction Between Power-Aware FPGA CAD Algorithms
As Field-Programmable Gate Array (FPGA) power consumption continues to increase, lower power FPGA circuitry, architectures, and Computer-Aided Design (CAD) tools need to be develo...
Julien Lamoureux, Steven J. E. Wilton
141
Voted
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
15 years 3 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 6 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
ORDER
2010
110views more  ORDER 2010»
15 years 3 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry