Sciweavers

640 search results - page 128 / 128
» Semantic Relations: Modelling Issues, Proposals and Possible...
Sort
View
PPOPP
2009
ACM
14 years 5 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ANLP
1994
101views more  ANLP 1994»
13 years 6 months ago
Sublanguage Engineering In The Fog System
FoG currently produces bilingual marine and public weather forecasts at several Canadian weather offices. The system is engineered to reflect "good professional style" a...
Richard I. Kittredge, Eli Goldberg, Myunghee Kim, ...
AAAI
1994
13 years 6 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
BMCBI
2010
144views more  BMCBI 2010»
13 years 5 months ago
Super-sparse principal component analyses for high-throughput genomic data
Background: Principal component analysis (PCA) has gained popularity as a method for the analysis of highdimensional genomic data. However, it is often difficult to interpret the ...
Donghwan Lee, Woojoo Lee, Youngjo Lee, Yudi Pawita...
TSP
2010
13 years 10 hour ago
Distributed sparse linear regression
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
Gonzalo Mateos, Juan Andrés Bazerque, Georg...