Sciweavers

26496 search results - page 5249 / 5300
» An Approach to Computing Ethics
Sort
View
DEBU
2007
111views more  DEBU 2007»
14 years 9 months ago
Multi-lingual Semantic Matching with OrdPath in Relational Systems
The volume of information in natural languages in electronic format is increasing exponentially. The demographics of users of information management systems are becoming increasin...
A. Kumaran, Peter Carlin
JUCS
2008
115views more  JUCS 2008»
14 years 9 months ago
Capturing Interaction Requirements in a Model Transformation Technology Based on MDA
: Currently, many models are used to capture functional software requirements. However, the Software Engineering community has faded interaction requirements into the background, d...
José Ignacio Panach, Sergio España, ...
79
Voted
JUCS
2008
130views more  JUCS 2008»
14 years 9 months ago
Feature Selection for the Classification of Large Document Collections
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
Janez Brank, Dunja Mladenic, Marko Grobelnik, Nata...
JCT
2006
100views more  JCT 2006»
14 years 9 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
ECCC
2007
90views more  ECCC 2007»
14 years 9 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
« Prev « First page 5249 / 5300 Last » Next »