Sciweavers

1455 search results - page 269 / 291
» Programming in Logic with Constraints for Natural Language P...
Sort
View
ECML
2007
Springer
13 years 10 months ago
Sequence Labeling with Reinforcement Learning and Ranking Algorithms
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
Francis Maes, Ludovic Denoyer, Patrick Gallinari
PPOPP
2009
ACM
14 years 9 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
EDBT
2010
ACM
145views Database» more  EDBT 2010»
14 years 6 days ago
Splash: ad-hoc querying of data and statistical models
Data mining is increasingly performed by people who are not computer scientists or professional programmers. It is often done as an iterative process involving multiple ad-hoc tas...
Lujun Fang, Kristen LeFevre
EUROSYS
2009
ACM
14 years 6 months ago
xCalls: safe I/O in memory transactions
Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolate...
Haris Volos, Andres Jaan Tack, Neelam Goyal, Micha...
MODELS
2009
Springer
14 years 1 months ago
An Example Is Worth a Thousand Words: Composite Operation Modeling By-Example
Abstract. Predefined composite operations are handy for efficient modeling, e.g., for the automatic execution of refactorings, and for the introduction of patterns in existing mod...
Petra Brosch, Philip Langer, Martina Seidl, Konrad...