Sciweavers

1983 search results - page 143 / 397
» Competitive graph searches
Sort
View
WWW
2007
ACM
14 years 8 months ago
Adaptive record extraction from web pages
We describe an adaptive method for extracting records from web pages. Our algorithm combines a weighted tree matching metric with clustering for obtaining data extraction patterns...
Justin Park, Denilson Barbosa
ICASSP
2009
IEEE
14 years 2 months ago
Fast LCD motion deblurring by decimation and optimization
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
Stanley H. Chan, Truong Q. Nguyen
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
14 years 2 months ago
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
—We introduce a novel metric space search data structure called EGNAT, which is fully dynamic and designed for secondary memory. The EGNAT is based on Brin’s GNAT static index,...
Roberto Uribe Paredes, Gonzalo Navarro
AMAST
2004
Springer
14 years 1 months ago
Formal JVM Code Analysis in JavaFAN
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
Azadeh Farzan, José Meseguer, Grigore Rosu
GECCO
2006
Springer
216views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparative analysis of the sailor assignment problem
In this work the performance of several local search and metaheuristic methods is compared to previously reported work using evolutionary algorithms. The results show that while m...
Joseph Vannucci, Deon Garrett, Dipankar Dasgupta