Sciweavers

2168 search results - page 96 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
105
Voted
ICANNGA
2007
Springer
141views Algorithms» more  ICANNGA 2007»
15 years 10 months ago
On Sum Coloring of Graphs with Parallel Genetic Algorithms
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
Zbigniew Kokosinski, Krzysztof Kwarciany
129
Voted
PVLDB
2010
134views more  PVLDB 2010»
15 years 2 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
112
Voted
ICPR
2008
IEEE
15 years 10 months ago
The polar distance transform by fast-marching
Image analysis tools that process the image using polar coordinates are needed to avoid the interpolation from polar to cartesian coordinates. We present a tool for analysing and ...
Robin Strand, Kristin Norell
160
Voted
DLOG
1998
15 years 5 months ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider
119
Voted
ACL
2009
15 years 1 months ago
Paraphrase Recognition Using Machine Learning to Combine Similarity Measures
This paper presents three methods that can be used to recognize paraphrases. They all employ string similarity measures apshallow abstractions of the input sentences, and a Maximu...
Prodromos Malakasiotis