Sciweavers

6943 search results - page 1318 / 1389
» Representations for evolutionary algorithms
Sort
View
EUROSYS
2006
ACM
16 years 27 days ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
SAC
2010
ACM
15 years 10 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
CICLING
2010
Springer
15 years 10 months ago
An Experimental Study on Unsupervised Graph-based Word Sense Disambiguation
Recent research works on unsupervised word sense disambiguation report an increase in performance, which reduces their handicap from the respective supervised approaches for the sa...
George Tsatsaronis, Iraklis Varlamis, Kjetil N&osl...
EDBT
2010
ACM
206views Database» more  EDBT 2010»
15 years 10 months ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...
KDD
2009
ACM
181views Data Mining» more  KDD 2009»
15 years 10 months ago
An exploration of climate data using complex networks
To discover patterns in historical data, climate scientists have applied various clustering methods with the goal of identifying regions that share some common climatological beha...
Karsten Steinhaeuser, Nitesh V. Chawla, Auroop R. ...
« Prev « First page 1318 / 1389 Last » Next »