Sciweavers

17329 search results - page 32 / 3466
» Improved non-approximability results
Sort
View
EMNLP
2009
13 years 6 months ago
Improving Dependency Parsing with Subtrees from Auto-Parsed Data
This paper presents a simple and effective approach to improve dependency parsing by using subtrees from auto-parsed data. First, we use a baseline parser to parse large-scale una...
Wenliang Chen, Jun'ichi Kazama, Kiyotaka Uchimoto,...
HIS
2009
13 years 6 months ago
Improved Harmony Search for Economic Power Dispatch
This paper presents a novel optimization approach using Improved Harmony Search (IHS) algorithm to solve economic power dispatch problem. The proposed methodology easily takes care...
V. Ravikumar Pandi, Bijaya K. Panigrahi, Manas Kum...
CORR
1998
Springer
128views Education» more  CORR 1998»
13 years 8 months ago
Indexing with WordNet synsets can improve Text Retrieval
The classical, vector space model for text retrieval is shown to give better results (up to 29% better in our experiments) if WordNet synsets are chosen as the indexing space, ins...
Julio Gonzalo, Felisa Verdejo, Irina Chugur, Juan ...
TSE
2002
94views more  TSE 2002»
13 years 8 months ago
Improving the Precision of INCA by Eliminating Solutions with Spurious Cycles
The Inequality Necessary Condition Analyzer (INCA) is a finite-state verification tool that has been able to check properties of some very large concurrent systems. INCA checks a p...
Stephen F. Siegel, George S. Avrunin
EUROIMSA
2006
141views Multimedia» more  EUROIMSA 2006»
13 years 10 months ago
Effective Organization and Visualization of Web Search Results
While searching the web, the user is often confronted by a great number of results, generally displayed in a list which is sorted according to the relevance of the results. Facing...
Nicolas Bonnel, Vincent Lemaire, Alexandre Cotarma...