Sciweavers

1403 search results - page 155 / 281
» Set cover algorithms for very large datasets
Sort
View
CVPR
2004
IEEE
16 years 8 months ago
Integrating Multiple Model Views for Object Recognition
We present a new approach to appearance-based object recognition, which captures the relationships between multiple model views and exploits them to improve recognition performanc...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...
INFOCOM
2008
IEEE
16 years 16 days ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
217
Voted
SSD
2001
Springer
218views Database» more  SSD 2001»
15 years 10 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
WEA
2009
Springer
104views Algorithms» more  WEA 2009»
16 years 27 days ago
Univariate Algebraic Kernel and Application to Arrangements
We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such...
Sylvain Lazard, Luis Mariano Peñaranda, Eli...
159
Voted
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
16 years 9 days ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...