Sciweavers

10414 search results - page 151 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 6 months ago
Communication-Efficient Construction of the Plane Localized Delaunay Graph
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Dam...
ECCC
2010
103views more  ECCC 2010»
15 years 6 months ago
Time-Space Efficient Simulations of Quantum Computations
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
Dieter van Melkebeek, Thomas Watson
DAWAK
2006
Springer
15 years 10 months ago
Efficient Mining of Large Maximal Bicliques
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
Guimei Liu, Kelvin Sim, Jinyan Li
JIIS
2006
124views more  JIIS 2006»
15 years 6 months ago
An efficient approach to mining indirect associations
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
JNW
2006
148views more  JNW 2006»
15 years 6 months ago
An Energy Efficient Approach to Dynamic Coverage in Wireless Sensor Networks
Tracking of mobile targets is an important application of sensor networks. This is a non-trivial problem as the increased accuracy of tracking results in an overall reduction in th...
Mohamed Khalil Watfa, Sesh Commuri