Sciweavers

944 search results - page 117 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
PAMI
2007
125views more  PAMI 2007»
14 years 9 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li
CASES
2004
ACM
15 years 1 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
EDBT
2006
ACM
191views Database» more  EDBT 2006»
15 years 10 months ago
Distributed Spatial Clustering in Sensor Networks
Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying dat...
Anand Meka, Ambuj K. Singh
CPAIOR
2008
Springer
14 years 11 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
IPM
2006
94views more  IPM 2006»
14 years 10 months ago
Binary Pathfinder: An improvement to the Pathfinder algorithm
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...