Sciweavers

944 search results - page 181 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
INFOCOM
2009
IEEE
15 years 4 months ago
Extreme Value FEC for Wireless Data Broadcasting
Abstract—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting ...
Weiyao Xiao, David Starobinski
KDD
2000
ACM
211views Data Mining» more  KDD 2000»
15 years 1 months ago
Mining IC test data to optimize VLSI testing
We describe an application of data mining and decision analysis to the problem of die-level functional test in integrated circuit manufacturing. Integrated circuits are fabricated...
Tony Fountain, Thomas G. Dietterich, Bill Sudyka
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
WIKIS
2006
ACM
15 years 3 months ago
SweetWiki: semantic web enabled technologies in Wiki
Wikis are social web sites enabling a potentially large number of participants to modify any page or create a new page using their web browser. As they grow, wikis may suffer from...
Michel Buffa, Fabien Gandon