Sciweavers

9842 search results - page 1301 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
IH
1999
Springer
15 years 11 months ago
Hiding Signatures in Graph Coloring Solutions
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
Gang Qu, Miodrag Potkonjak
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
15 years 11 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
KES
1999
Springer
15 years 11 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
LLL
1999
Springer
15 years 11 months ago
Learning to Lemmatise Slovene Words
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
Saso Dzeroski, Tomaz Erjavec
NOMS
1998
IEEE
133views Communications» more  NOMS 1998»
15 years 11 months ago
ATM customer network management using WWW and CORBA technologies
In this paper, we present a framework for managing ATM customer networks using WWW and CORBA technologies. The WWW technology may provide network management operators with platfor...
Jong-Wook Baek, Tae-Joon Ha, Jong-Tae Park, James ...
« Prev « First page 1301 / 1969 Last » Next »