Sciweavers

994 search results - page 95 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
110
Voted
ICAC
2007
IEEE
15 years 7 months ago
Autonomous Return on Investment Analysis of Additional Processing Resources
As the use of virtualization and partitioning grows, it becomes possible to deploy a multi-tier web-based application with a variable amount of computing power. This introduces th...
Jonathan Wildstrom, Peter Stone, Emmett Witchel
109
Voted
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 1 months ago
Markov Blankets and Meta-heuristics Search: Sentiment Extraction from Unstructured Texts
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
Edoardo Airoldi, Xue Bai, Rema Padman
76
Voted
JEI
2007
79views more  JEI 2007»
15 years 16 days ago
Stereo matching via selective multiple windows
Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window co...
Satyajit Anil Adhyapak, Nasser D. Kehtarnavaz, Mih...
SEMCO
2007
IEEE
15 years 7 months ago
Unrestricted Coreference: Identifying Entities and Events in OntoNotes
Most research in the field of anaphora or coreference detection has been limited to noun phrase coreference, usually on a restricted set of entities, such as ACE entities. In par...
Sameer S. Pradhan, Lance A. Ramshaw, Ralph M. Weis...
EUROPAR
2010
Springer
15 years 24 days ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...