Sciweavers

1033 search results - page 134 / 207
» The Relative History Heuristic
Sort
View
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
15 years 1 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 16 hour ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
CORR
2010
Springer
154views Education» more  CORR 2010»
14 years 12 months ago
A New Email Retrieval Ranking Approach
Email Retrieval task has recently taken much attention to help the user retrieve the email(s) related to the submitted query. Up to our knowledge, existing email retrieval ranking...
Samir AbdelRahman, Basma Hassan, Reem Bahgat
EMNLP
2009
14 years 9 months ago
Generalized Expectation Criteria for Bootstrapping Extractors using Record-Text Alignment
Traditionally, machine learning approaches for information extraction require human annotated data that can be costly and time-consuming to produce. However, in many cases, there ...
Kedar Bellare, Andrew McCallum
CEC
2010
IEEE
14 years 9 months ago
A hybrid multi-objective extremal optimisation approach for multi-objective combinatorial optimisation problems
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
Pedro Gómez-Meneses, Marcus Randall, Andrew...