Sciweavers

699 search results - page 75 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
MM
2004
ACM
104views Multimedia» more  MM 2004»
15 years 3 months ago
A robust and accumulator-free ellipse hough transform
The ellipse Hough transform (EHT) is a widely-used technique. Most of the previous modifications to the standard EHT improved either the voting procedure that computes the absolut...
Xinguo Yu, Hon Wai Leong, Changsheng Xu, Qi Tian
PVLDB
2010
85views more  PVLDB 2010»
14 years 8 months ago
Evaluating Entity Resolution Results
Entity Resolution (ER) is the process of identifying groups of records that refer to the same real-world entity. Various measures (e.g., pairwise F1, cluster F1) have been used fo...
David Menestrina, Steven Whang, Hector Garcia-Moli...
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 2 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
BIRTHDAY
2010
Springer
14 years 6 months ago
Quantitative Simulation Games
Abstract. Classical formalizations of systems and properties are boolean: given a system and a property, the property is either true or false of the system. The classical view part...
Pavol Cerný, Thomas A. Henzinger, Arjun Rad...
POPL
2006
ACM
15 years 10 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...