4140 search results - page 518 / 828 » A Use Case Based Approach to Feature Models' Construction |
162
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We developed and tested a heuristic technique for extracting the main article from news site Web pages. We construct the DOM tree of the page and score every node based on the amo...
214
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
177
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
213
click to vote
SPIRE
2005
Springer
16 years 2 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
176
click to vote
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
The focus of this work is on using texture information for searching, browsing and retrieving images from a large database. In the wavelet approaches, texture is characterized by ...